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 PredecessorEnumerator(GraphAdjList <NODE, EDGE> g, NODE n)
{
graph = g;
node = n;
}
public Edge(GraphAdjList <NAME, NODE, EDGE> .Vertex f, GraphAdjList <NAME, NODE, EDGE> .Vertex t)
: base(f, t)
{
}
public SuccessorEnumerator(GraphAdjList <NAME, NODE, EDGE> g, NAME n)
{
graph = g;
name = n;
}
public ReversePredecessorEnumerator(GraphAdjList <NAME, NODE, EDGE> g, NAME n)
{
graph = g;
name = n;
}
