org.graphstream.algorithm

Class LongestPath

java.lang.Object

org.graphstream.algorithm.LongestPath

All Implemented Interfaces:

Algorithm

public class LongestPath
extends java.lang.Object
implements Algorithm

Implementation of longest path algorithm in a DAG (directed acyclic graph) using topologicalSort

Computational Complexity:

yet to be calculated

Field Summary

Fields

Modifier and Type	Field and Description
static java.lang.String	DEFAULT_WEIGHT_ATTRIBUTE Default weight attribute

Constructor Summary

Constructors

Constructor and Description
LongestPath()

Method Summary

Modifier and Type	Method and Description
void	compute() Run the algorithm.
java.lang.String	defaultResult()
org.graphstream.graph.Path	getLongestPath() gets longest path
java.util.List<org.graphstream.graph.Node>	getLongestPathList() gets sorted list of the longest path
java.lang.Double	getLongestPathValue() get value of longest path if unweighted value = hops
java.lang.String	getWeightAttribute()
void	init(org.graphstream.graph.Graph theGraph) Initialization of the algorithm.
void	setWeightAttribute(java.lang.String weightAttribute)

Methods inherited from class java.lang.Object

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

Field Detail

DEFAULT_WEIGHT_ATTRIBUTE

public static final java.lang.String DEFAULT_WEIGHT_ATTRIBUTE

Default weight attribute

See Also:

Constant Field Values

Constructor Detail

LongestPath

public LongestPath()

Method Detail

init

public void init(org.graphstream.graph.Graph theGraph)

Description copied from interface: Algorithm

Initialization of the algorithm. This method has to be called before the Algorithm.compute() method to initialize or reset the algorithm according to the new given graph.

Specified by:

init in interface Algorithm

Parameters:

theGraph - The graph this algorithm is using.

compute

public void compute()

Description copied from interface: Algorithm

Run the algorithm. The Algorithm.init(Graph) method has to be called before computing.

Specified by:

compute in interface Algorithm

See Also:

Algorithm.init(Graph)

getLongestPathList

public java.util.List<org.graphstream.graph.Node> getLongestPathList()

gets sorted list of the longest path

Returns:

sorted list of nodes in longest path

getLongestPath

public org.graphstream.graph.Path getLongestPath()

gets longest path

Returns:

longest path

defaultResult

public java.lang.String defaultResult()

getLongestPathValue

public java.lang.Double getLongestPathValue()

get value of longest path if unweighted value = hops

Returns:

value of longest path

getWeightAttribute

public java.lang.String getWeightAttribute()

setWeightAttribute

public void setWeightAttribute(java.lang.String weightAttribute)