Constructor Detail

• TimeDirectedNeighborIndex

  public TimeDirectedNeighborIndex(org.jgrapht.Graph<Spot,org.jgrapht.graph.DefaultWeightedEdge> g)

Method Detail

• predecessorsOf

  public Set<Spot> predecessorsOf(Spot v)

  Returns the set of vertices which are the predecessors of a specified vertex. The returned set is backed by the index, and will be updated when the graph changes as long as the index has been added as a listener to the graph.

  Overrides:

  predecessorsOf in class org.jgrapht.alg.util.NeighborCache<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  Parameters:

  v - the vertex whose predecessors are desired

  Returns:

  all unique predecessors of the specified vertex

• predecessorListOf

  public List<Spot> predecessorListOf(Spot v)

  Returns the set of vertices which are the predecessors of a specified vertex. If the graph is a multigraph, vertices may appear more than once in the returned list. Because a list of predecessors can not be efficiently maintained, it is reconstructed on every invocation by duplicating entries in the neighbor set. It is thus more efficient to use predecessorsOf(Spot) unless duplicate neighbors are required.

  Parameters:

  v - the vertex whose predecessors are desired

  Returns:

  all predecessors of the specified vertex

• successorsOf

  public Set<Spot> successorsOf(Spot v)

  Returns the set of vertices which are the successors of a specified vertex. The returned set is backed by the index, and will be updated when the graph changes as long as the index has been added as a listener to the graph.

  Overrides:

  successorsOf in class org.jgrapht.alg.util.NeighborCache<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  Parameters:

  v - the vertex whose successors are desired

  Returns:

  all unique successors of the specified vertex

• successorListOf

  public List<Spot> successorListOf(Spot v)

  Returns the set of vertices which are the successors of a specified vertex. If the graph is a multigraph, vertices may appear more than once in the returned list. Because a list of successors can not be efficiently maintained, it is reconstructed on every invocation by duplicating entries in the neighbor set. It is thus more efficient to use successorsOf(Spot) unless duplicate neighbors are required.

  Parameters:

  v - the vertex whose successors are desired

  Returns:

  all successors of the specified vertex

• edgeAdded

  public void edgeAdded(org.jgrapht.event.GraphEdgeChangeEvent<Spot,org.jgrapht.graph.DefaultWeightedEdge> e)

  Specified by:

  edgeAdded in interface org.jgrapht.event.GraphListener<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  Overrides:

  edgeAdded in class org.jgrapht.alg.util.NeighborCache<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  See Also:

  GraphListener.edgeAdded(GraphEdgeChangeEvent)

• edgeRemoved

  public void edgeRemoved(org.jgrapht.event.GraphEdgeChangeEvent<Spot,org.jgrapht.graph.DefaultWeightedEdge> e)

  Specified by:

  edgeRemoved in interface org.jgrapht.event.GraphListener<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  Overrides:

  edgeRemoved in class org.jgrapht.alg.util.NeighborCache<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  See Also:

  GraphListener.edgeRemoved(GraphEdgeChangeEvent)

• vertexAdded

  public void vertexAdded(org.jgrapht.event.GraphVertexChangeEvent<Spot> e)

  Specified by:

  vertexAdded in interface org.jgrapht.event.VertexSetListener<Spot>

  Overrides:

  vertexAdded in class org.jgrapht.alg.util.NeighborCache<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  See Also:

  VertexSetListener.vertexAdded(GraphVertexChangeEvent)

• vertexRemoved

  public void vertexRemoved(org.jgrapht.event.GraphVertexChangeEvent<Spot> e)

  Specified by:

  vertexRemoved in interface org.jgrapht.event.VertexSetListener<Spot>

  Overrides:

  vertexRemoved in class org.jgrapht.alg.util.NeighborCache<Spot,org.jgrapht.graph.DefaultWeightedEdge>

  See Also:

  VertexSetListener.vertexRemoved(GraphVertexChangeEvent)