soot.toolkits.graph
Interface Orderer

All Known Implementing Classes:
PseudoTopologicalOrderer, SlowPseudoTopologicalOrderer

public interface Orderer

An orderer builds an order on a directed, not necessarily acyclic, graph.

Author:
Eric Bodden

Method Summary
 List newList(DirectedGraph g, boolean reverse)
          Builds an order for a directed graph.
 

Method Detail

newList

public List newList(DirectedGraph g,
                    boolean reverse)
Builds an order for a directed graph. The order is represented by the returned list, i.e. is a node was assigned number i in the order, it will be in the ith position of the returned list.

Parameters:
g - a DirectedGraph instance whose nodes we wish to order
reverse - true to compute the reverse order
Returns:
a somehow ordered list of the graph's nodes