Gephi Toolkit Javadoc

org.gephi.algorithms.shortestpath
Class AbstractShortestPathAlgorithm

java.lang.Object
  extended by org.gephi.algorithms.shortestpath.AbstractShortestPathAlgorithm
Direct Known Subclasses:
BellmanFordShortestPathAlgorithm, DijkstraShortestPathAlgorithm

public abstract class AbstractShortestPathAlgorithm
extends java.lang.Object

Author:
Mathieu Bastian

Field Summary
protected  java.util.HashMap<Node,java.awt.Color> colors
           
protected  java.util.HashMap<Node,java.lang.Double> distances
           
protected  double maxDistance
           
protected  Node sourceNode
           
 
Constructor Summary
AbstractShortestPathAlgorithm(Node sourceNode)
           
 
Method Summary
abstract  void compute()
           
protected  double edgeWeight(Edge edge)
           
 java.util.HashMap<Node,java.lang.Double> getDistances()
           
 double getMaxDistance()
           
abstract  Node getPredecessor(Node node)
           
abstract  Edge getPredecessorIncoming(Node node)
           
protected  boolean relax(Edge edge)
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

colors

protected final java.util.HashMap<Node,java.awt.Color> colors

distances

protected final java.util.HashMap<Node,java.lang.Double> distances

sourceNode

protected final Node sourceNode

maxDistance

protected double maxDistance
Constructor Detail

AbstractShortestPathAlgorithm

public AbstractShortestPathAlgorithm(Node sourceNode)
Method Detail

relax

protected boolean relax(Edge edge)

edgeWeight

protected double edgeWeight(Edge edge)

compute

public abstract void compute()

getPredecessor

public abstract Node getPredecessor(Node node)

getPredecessorIncoming

public abstract Edge getPredecessorIncoming(Node node)

getDistances

public java.util.HashMap<Node,java.lang.Double> getDistances()

getMaxDistance

public double getMaxDistance()

Gephi Toolkit Javadoc