org.gephi.algorithms.shortestpath

Class AbstractShortestPathAlgorithm

java.lang.Object

org.gephi.algorithms.shortestpath.AbstractShortestPathAlgorithm

Direct Known Subclasses:

BellmanFordShortestPathAlgorithm, DijkstraShortestPathAlgorithm

public abstract class AbstractShortestPathAlgorithm
extends Object

Author:

Mathieu Bastian

Constructor Summary

Constructors

Constructor and Description
AbstractShortestPathAlgorithm(org.gephi.graph.api.Node sourceNode)

Method Summary

Modifier and Type	Method and Description
abstract void	compute()
HashMap<org.gephi.graph.api.Node,Double>	getDistances()
double	getMaxDistance()
org.gephi.graph.api.Node	getPredecessor(org.gephi.graph.api.Node node)
org.gephi.graph.api.Edge	getPredecessorIncoming(org.gephi.graph.api.Node node)
abstract Map<org.gephi.graph.api.Node,org.gephi.graph.api.Edge>	getPredecessors()

Methods inherited from class java.lang.Object

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

Constructor Detail

AbstractShortestPathAlgorithm

public AbstractShortestPathAlgorithm(org.gephi.graph.api.Node sourceNode)

Method Detail

compute

public abstract void compute()

getPredecessors

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

getPredecessor

public final org.gephi.graph.api.Node getPredecessor(org.gephi.graph.api.Node node)

getPredecessorIncoming

public final org.gephi.graph.api.Edge getPredecessorIncoming(org.gephi.graph.api.Node node)

getDistances

public HashMap<org.gephi.graph.api.Node,Double> getDistances()

getMaxDistance

public double getMaxDistance()