How to find optimal path visit every node with parallel workers complicated by dynamic edge costs?

Posted by Aaron Anodide on Programmers See other posts from Programmers or by Aaron Anodide
Published on 2012-10-25T22:02:18Z Indexed on 2012/10/25 23:15 UTC
Read the original article Hit count: 183

Filed under:
|

Say you have an acyclic directed graph with weighted edges and create N workers.

My goal is to calculate the optimal way those workers can traverse the entire graph in parralel.

However, edge costs may change along the way.

Example:

A -1-> B
A -2-> C
B -3-> C (if A has already been visited)
B -5-> C (if A has not already been visited)

Does what I describe lend itself to a standard algorithmic approach, or alternately can someone suggest if I'm looking at this in an inherently flawed way (i have an intuition I might be)?

© Programmers or respective owner

Related posts about algorithms

Related posts about trees