libtbx.topological_sort
index
/net/chevy/raid1/nat/src/cctbx_project/libtbx/topological_sort.py

 
Functions
       
find_path(successors_by_node, from_node, to_node)
stable(connections)
strongly_connected_components(successors_by_node, omit_single_node_components=True, low_infinite=1073741824)
successors_by_node = {
  "node1": ["successor1", "successor2"],
  "node2": ["successor1", "successor3"]
}
 
http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
http://www.logarithmic.net/pfh-files/blog/01208083168/sort.py
 
Original implementation (by Paul Harrison), modified to accommodate
successors that do not appear as a key in successors_by_node.

 
Data
        division = _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192)