CareerCup

Use topologically sorted graph

How will it be if we use a graph data structure? In this A->B,A->C,B->D. So you will probably have an array of nextNode in the data structure to hold as many as dependencies.

yes I guess you can use a graph and so the data structure would be an adjcency list or an adj matrix. But the important thing to do here is Topological Sort. This will give us the order in which we should compile the jars.

by representing it in graph:
A-->B
| |
v v
C D ( v is actually arrow mark ! )

Apply topological sort:
We get 3 possible orderings:
A-->B-->C-->D
A-->B-->D-->C
A-->C-->B-->D

so, it can be either B or C

To compute a topological ordering of G:
Find a node v with no incoming edges and order it first
Delete v from G
Recursively compute a topological ordering of G-{v}
and append this order after v

place the jar names in a tree; traverse the tree in post-order; the order traversed is the order in which the jars should be (e.g. can be legitimately) built.

did not understand the question? sounds very stupid question