# File lib/kwala/lib/cycle_detector.rb, line 467 def print_graph(graph) print_ml_wrapper do #print_sub_clusers(graph.keys) # Reorder the nodes based upon if it has edges or not. # Prefuse, fails if the first nodes do not have any links to # or from it. noedge, edge = graph.sort.partition { |k,v| v.edges.empty? } (edge + noedge).each do |k, v| print_node(v) end print_edges end end