Does JGraphT has ability to run a Topological Sort on a graph that will purge forward edges (or at least label them as such) and the resulting graph will have accessible root list of nodes (top level nodes of all trees in the graph)
Asked
Active
Viewed 394 times
2
-
1On SO we share code along with known input and desired output. – Anthony Oct 31 '14 at 15:59
-
1Is that true of ALL questions on SO? This happens to be a concept question, if you don't understand the question - don't answer it. – Andrey Oct 31 '14 at 16:26