/*
* (C) Copyright 2016-2017, by Dimitrios Michail and Contributors.
*
* JGraphT : a free Java graph-theory library
*
* This program and the accompanying materials are dual-licensed under
* either
*
* (a) the terms of the GNU Lesser General Public License version 2.1
* as published by the Free Software Foundation, or (at your option) any
* later version.
*
* or (per the licensee's choosing)
*
* (b) the terms of the Eclipse Public License v1.0 as published by
* the Eclipse Foundation.
*/
package org.jgrapht.alg.shortestpath;
import java.io.*;
import java.util.*;
import org.jgrapht.*;
import org.jgrapht.alg.interfaces.ShortestPathAlgorithm.*;
import org.jgrapht.alg.util.*;
import org.jgrapht.graph.*;
/**
* An implementation of {@link SingleSourcePaths} which uses linear space.
*
*
* This implementation uses the traditional representation of maintaining for each vertex the
* predecessor in the shortest path tree. In order to keep space to linear, the paths are recomputed
* in each invocation of the {@link #getPath(Object)} method. The complexity of
* {@link #getPath(Object)} is linear to the number of edges of the path while the complexity of
* {@link #getWeight(Object)} is O(1).
*
* @author Dimitrios Michail
*
* @param the graph vertex type
* @param the graph edge type
*/
public class TreeSingleSourcePathsImpl
implements SingleSourcePaths, Serializable
{
private static final long serialVersionUID = -5914007312734512847L;
/**
* The graph
*/
protected Graph g;
/**
* The source vertex
*/
protected V source;
/**
* A map which keeps for each target vertex the predecessor edge and the total length of the
* shortest path.
*/
protected Map> map;
/**
* Construct a new instance.
*
* @param g the graph
* @param source the source vertex
* @param distanceAndPredecessorMap a map which contains for each vertex the distance and the
* last edge that was used to discover the vertex. The map does not need to contain any
* entry for the source vertex. In case it does contain the predecessor at the source
* vertex must be null.
*/
public TreeSingleSourcePathsImpl(
Graph g, V source, Map> distanceAndPredecessorMap)
{
this.g = Objects.requireNonNull(g, "Graph is null");
this.source = Objects.requireNonNull(source, "Source vertex is null");
this.map = Objects
.requireNonNull(distanceAndPredecessorMap, "Distance and predecessor map is null");
}
/**
* {@inheritDoc}
*/
@Override
public Graph getGraph()
{
return g;
}
/**
* {@inheritDoc}
*/
@Override
public V getSourceVertex()
{
return source;
}
/**
* {@inheritDoc}
*/
@Override
public double getWeight(V targetVertex)
{
Pair p = map.get(targetVertex);
if (p == null) {
if (source.equals(targetVertex)) {
return 0d;
} else {
return Double.POSITIVE_INFINITY;
}
} else {
return p.getFirst();
}
}
/**
* {@inheritDoc}
*/
@Override
public GraphPath getPath(V targetVertex)
{
if (source.equals(targetVertex)) {
return new GraphWalk<>(g, source, targetVertex, null, Collections.emptyList(), 0d);
}
LinkedList edgeList = new LinkedList<>();
V cur = targetVertex;
Pair p = map.get(cur);
if (p == null) {
return null;
}
double weight = 0d;
while (p != null && !p.equals(source)) {
E e = p.getSecond();
if (e == null) {
break;
}
edgeList.addFirst(e);
weight += g.getEdgeWeight(e);
cur = Graphs.getOppositeVertex(g, e, cur);
p = map.get(cur);
}
return new GraphWalk<>(g, source, targetVertex, null, edgeList, weight);
}
}
Ads help maintain this website.