This problem can be mapped to the Topological sorting of vertices in a graph assuming each component as the vertice in the graph and edge as the dependency indicator.For more details see the link below.
http://en.wikipedia.org/wiki/Topological_sorting
Unix have tsort program for doing the same.
For a DAG(directed acyclic graph) tsort produces a listing of the vertices so that for all edges 'a->b', 'a' comes before 'b' in the listing. This is used in MakeFile for identifying the build order of the components in a way to fulfill dependencies. This will not work when the graph have cycles. (Cyclic dependencies are not taken care).
http://en.wikipedia.org/wiki/Tsort_%28Unix%29
Categories
FollowersBlog Archive
Jobs
Find more freelance jobs
|
Tuesday, October 18, 2011
Subscribe to:
Post Comments (Atom)
|
Popular Posts
|
I didn't understand properly.Can you please give a concrete example to throw more light to it.
ReplyDelete