Minimal Ordered Build List

Topics: algorithm
Jul 14, 2009 at 7:40 AM

Hello every one!

Typical compilation order problem:

In a graph of dependencies between files, how to get the minimal ordered (re)build list  starting from one source to the target(s).

Remark : Using the topological sort algorithm on the graph, I get the ordered (re)build list with all files, witch is too much.

Thanks for helping

Code exemple welcome :-)

Thanks, Regards

Stephane

Coordinator
Jul 14, 2009 at 3:40 PM

an example would be helpful. Not what you are trying to solve exactly...