public ReverseSuccessorEnumerator(GraphAdjList <NODE, EDGE> g, NODE n)
{
graph = g;
node = n;
}
public SuccessorEdgeEnumerator(GraphAdjList <NODE, EDGE> g, NODE n)
{
graph = g;
node = n;
}
public ReverseSuccessorEnumerator(GraphAdjList <NAME> g, NAME n)
{
graph = g;
name = n;
}
public PredecessorEnumerator(GraphAdjList <NODE, EDGE> g, NODE n)
{
graph = g;
node = n;
}
public PredecessorEnumerator(GraphAdjList <NAME> g, NAME n)
{
graph = g;
name = n;
}
