org.gephi.algorithms.shortestpath
Class BellmanFordShortestPathAlgorithm
java.lang.Object
org.gephi.algorithms.shortestpath.AbstractShortestPathAlgorithm
org.gephi.algorithms.shortestpath.BellmanFordShortestPathAlgorithm
public class BellmanFordShortestPathAlgorithm
- extends AbstractShortestPathAlgorithm
- Author:
- Mathieu Bastian
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
graph
protected final DirectedGraph graph
predecessors
protected final java.util.HashMap<Node,Edge> predecessors
timeInterval
protected TimeInterval timeInterval
BellmanFordShortestPathAlgorithm
public BellmanFordShortestPathAlgorithm(DirectedGraph graph,
Node sourceNode)
compute
public void compute()
- Specified by:
compute
in class AbstractShortestPathAlgorithm
edgeWeight
protected double edgeWeight(Edge edge)
- Overrides:
edgeWeight
in class AbstractShortestPathAlgorithm
getPredecessor
public Node getPredecessor(Node node)
- Specified by:
getPredecessor
in class AbstractShortestPathAlgorithm
getPredecessorIncoming
public Edge getPredecessorIncoming(Node node)
- Specified by:
getPredecessorIncoming
in class AbstractShortestPathAlgorithm