IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( pkDependencyGraph); while (sorter.hasNext()) Digraph contractedDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); contractor.contract(contractedDigraph, CollectionFactory.ARRAYLIST_FACTORY); IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( contractedDigraph); while (sorter.hasNext()) {
IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( pkDependencyGraph); while (sorter.hasNext()) Digraph contractedDigraph = new MapDigraph(MapDigraph.HASHMAP_FACTORY); contractor.contract(contractedDigraph, CollectionFactory.ARRAYLIST_FACTORY); IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( contractedDigraph); while (sorter.hasNext()) {
tables = new ArrayList(tableCount); sequencesByTable = new HashMap(tableCount); Algorithm sorter = new IndegreeTopologicalSort(graph); List sortedVertices = new ArrayList(graph.order()); while (sorter.hasNext())
contractedReferentialDigraph, CollectionFactory.ARRAYLIST_FACTORY); IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( contractedReferentialDigraph); components = new HashMap(contractedReferentialDigraph.order());
contractedReferentialDigraph, CollectionFactory.ARRAYLIST_FACTORY); IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( contractedReferentialDigraph); components = new HashMap(contractedReferentialDigraph.order());
private void init(Digraph digraph) { vertexRankMap = new HashMap(digraph.order()); IndegreeTopologicalSort traversal = new IndegreeTopologicalSort(digraph); while (traversal.hasNext()) { Object vertex = traversal.next(); int rank = -1; for (ArcIterator i = digraph.incomingIterator(vertex); i.hasNext(); ) { i.next(); Object predecessor = i.getOrigin(); int predRank = intValue(predecessor); if (predRank < 0) throw new ArithmeticException("Ranking failed."); rank = Math.max(rank, predRank); } rank++; assignRank(vertex, rank); } }
new IndegreeTopologicalSort(subgraphOrderingGraph); Map indexMap = new HashMap(); int sortIndex = 0;
IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( objectDependencyGraph);
IndegreeTopologicalSort sorter = new IndegreeTopologicalSort( objectDependencyGraph);