Searched refs:topologicalSort (Results 1 – 7 of 7) sorted by relevance
36 g.topologicalSort(); in sort()55 g.topologicalSort(); in cycleShouldFail()63 g.topologicalSort(); in cycleShouldBeCorrect()104 g.topologicalSort(); in findPredecessors()
191 private static Graph<ITestNGMethod> topologicalSort(ITestNGMethod[] methods, in topologicalSort() method in MethodHelper231 result.topologicalSort(); in topologicalSort()287 topologicalSort(allMethodsArray, sl, pl); in sortMethods()303 g = topologicalSort(methods, sequentialList, parallelList); in getMethodsDependedUpon()
100 public void topologicalSort() { in topologicalSort() method in Graph
168 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { in topologicalSort() function in BasicBlock172 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()296 int NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
300 void topologicalSort();474 void topologicalSort();
610 topologicalSort(); in getBlocks()1128 void SIScheduleBlockCreator::topologicalSort() { in topologicalSort() function in SIScheduleBlockCreator1672 void SIScheduleDAGMI::topologicalSort() { in topologicalSort() function in SIScheduleDAGMI1793 topologicalSort(); in schedule()
1661 int topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID);