soot.toolkits.graph
Interface Orderer<N>

All Known Implementing Classes:

PseudoTopologicalOrderer, ReversePseudoTopologicalOrderer, SlowPseudoTopologicalOrderer

public interface Orderer<N>

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

Author:

Eric Bodden

Method Summary

List<N>

newList(DirectedGraph<N> g, boolean reverse) Builds an order for a directed graph.

Method Detail

newList

List<N> newList(DirectedGraph<N> 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