if nodesKept := g.SelectTopNodePtrs(nodeCount, visualMode); len(g.Nodes) != len(nodesKept) {
				g.TrimTree(nodesKept)
				g.SortNodes(cumSort, visualMode)
			}
		} else {
			if nodesKept := g.SelectTopNodes(nodeCount, visualMode); len(g.Nodes) != len(nodesKept) {
				g = rpt.newGraph(nodesKept)
				g.SortNodes(cumSort, visualMode)
			}
		}
	}

			if abs64(e.Weight) < edgeCutoff {
				delete(n.In, src)
				delete(src.Out, n)
				droppedEdges++
			}
		}
	}
	return droppedEdges
}

// SortNodes sorts the nodes in a graph based on a specific heuristic.
func (g *Graph) SortNodes(cum bool, visualMode bool) {
	// Sort nodes based on requested mode
	switch {
	case visualMode:
		// Specialized sort to produce a more visually-interesting graph

Descriptor); } org/apache/ivy/core/sort/SortEngine.class package org.apache.ivy.core.sort; public final synchronized class SortEngine { private SortEngineSettings settings; public void SortEngine(SortEngineSettings); public final java.util.List sortNodes(java.util.Collection, SortOptions); } org/apache/ivy/core/sort/CollectionOfModulesT.class package org.apache.ivy.core.sort; final synchronized class CollectionOfModulesT { private final java.util.List moduleDescriptors; private final org.apache....