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

Constructor Summary

Constructors

Constructor and Description
BellmanFordShortestPathAlgorithm(org.gephi.graph.api.DirectedGraph graph, org.gephi.graph.api.Node sourceNode)

Method Summary

Modifier and Type	Method and Description
void	compute()
Map<org.gephi.graph.api.Node,org.gephi.graph.api.Edge>	getPredecessors()

Methods inherited from class org.gephi.algorithms.shortestpath.AbstractShortestPathAlgorithm

getDistances, getMaxDistance, getPredecessor, getPredecessorIncoming

Methods inherited from class java.lang.Object

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

Constructor Detail

BellmanFordShortestPathAlgorithm

public BellmanFordShortestPathAlgorithm(org.gephi.graph.api.DirectedGraph graph,
                                        org.gephi.graph.api.Node sourceNode)

Method Detail

compute

public void compute()

Specified by:

compute in class AbstractShortestPathAlgorithm

getPredecessors

public Map<org.gephi.graph.api.Node,org.gephi.graph.api.Edge> getPredecessors()

Specified by:

getPredecessors in class AbstractShortestPathAlgorithm