jpaul.Graphs
Class LDiGraph.LNavigator<Vertex,Label>

java.lang.Object
  jpaul.Graphs.LDiGraph.LForwardNavigator<Vertex,Label>
      jpaul.Graphs.LDiGraph.LNavigator<Vertex,Label>

All Implemented Interfaces:

ForwardNavigator<Vertex>, Navigator<Vertex>

Enclosing class:

LDiGraph<Vertex,Label>

public abstract static class LDiGraph.LNavigator<Vertex,Label>
extends LDiGraph.LForwardNavigator<Vertex,Label>
implements Navigator<Vertex>

Bidirectional iterator into a labeled graph. Each labeled navigator is also a normal navigator: we just strip the labels off the arcs.

Constructor Summary

LDiGraph.LNavigator()

Method Summary

abstract java.util.List<Pair<Vertex,Label>>	lprev(Vertex v) Returns the list of the arcs that enter into the vertex v.
java.util.List<Vertex>	prev(Vertex v) Returns the predecessors of vertex.

Methods inherited from class jpaul.Graphs.LDiGraph.LForwardNavigator

lnext, next

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface jpaul.Graphs.ForwardNavigator

next

Constructor Detail

LDiGraph.LNavigator

public LDiGraph.LNavigator()

Method Detail

lprev

public abstract java.util.List<Pair<Vertex,Label>> lprev(Vertex v)

Returns the list of the arcs that enter into the vertex v. Each arc is modeled as a pair of the source vertex and the arc label.

prev

public java.util.List<Vertex> prev(Vertex v)

Description copied from interface: Navigator

Returns the predecessors of vertex.

Specified by:

prev in interface Navigator<Vertex>