Package org.jgrapht.alg.shortestpath

Class ListMultiObjectiveSingleSourcePathsImpl<V,E>

java.lang.Object

org.jgrapht.alg.shortestpath.ListMultiObjectiveSingleSourcePathsImpl<V,E>

Type Parameters:

V - the graph vertex type

E - the graph edge type

All Implemented Interfaces:

java.io.Serializable, MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>

public class ListMultiObjectiveSingleSourcePathsImpl<V,E>
extends java.lang.Object
implements MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>, java.io.Serializable

An implementation of MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths which stores one list of paths per vertex.

Author:

Dimitrios Michail

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field	Description
protected Graph<V,E>	graph	The graph
protected java.util.Map<V,java.util.List<GraphPath<V,E>>>	paths	One path per vertex
protected V	source	The source vertex of all paths

Constructor Summary

Constructors

Constructor	Description
ListMultiObjectiveSingleSourcePathsImpl(Graph<V,E> graph, V source, java.util.Map<V,java.util.List<GraphPath<V,E>>> paths)	Construct a new instance.

Method Summary

Modifier and Type	Method	Description
Graph<V,E>	getGraph()	Returns the graph over which this set of paths is defined.
java.util.List<GraphPath<V,E>>	getPaths(V targetVertex)	Return the path from the source vertex to the sink vertex.
V	getSourceVertex()	Returns the single source vertex.

Methods inherited from class java.lang.Object

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

Field Detail

graph

protected Graph<V,E> graph

The graph

source

protected V source

The source vertex of all paths

paths

protected java.util.Map<V,java.util.List<GraphPath<V,E>>> paths

One path per vertex

Constructor Detail

ListMultiObjectiveSingleSourcePathsImpl

public ListMultiObjectiveSingleSourcePathsImpl(Graph<V,E> graph,
                                               V source,
                                               java.util.Map<V,java.util.List<GraphPath<V,E>>> paths)

Construct a new instance.

Parameters:

graph - the graph

source - the source vertex

paths - a list of paths per target vertex

Method Detail

getGraph

public Graph<V,E> getGraph()

Description copied from interface: MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths

Returns the graph over which this set of paths is defined.

Specified by:

getGraph in interface MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>

Returns:

the graph

getSourceVertex

public V getSourceVertex()

Description copied from interface: MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths

Returns the single source vertex.

Specified by:

getSourceVertex in interface MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>

Returns:

the single source vertex

getPaths

public java.util.List<GraphPath<V,E>> getPaths(V targetVertex)

Description copied from interface: MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths

Return the path from the source vertex to the sink vertex.

Specified by:

getPaths in interface MultiObjectiveShortestPathAlgorithm.MultiObjectiveSingleSourcePaths<V,E>

Parameters:

targetVertex - the sink vertex

Returns:

the path from the source vertex to the sink vertex or null if no such path exists