GraphLab Project

graphlab.library.algorithms.shortestpath
Class FloydWarshall<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>

java.lang.Object
  extended by graphlab.library.algorithms.shortestpath.FloydWarshall<VertexType,EdgeType>

public class FloydWarshall<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
extends java.lang.Object

This method finds the shortest paths between any two vertices of a graph.

Author:
Soroush Sabet, edited by Omid Aladini

Constructor Summary
FloydWarshall()
           
 
Method Summary
 java.lang.Integer[][] getAllPairsShortestPath(BaseGraph<VertexType,EdgeType> graph)
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

FloydWarshall

public FloydWarshall()
Method Detail

getAllPairsShortestPath

public java.lang.Integer[][] getAllPairsShortestPath(BaseGraph<VertexType,EdgeType> graph)
Parameters:
graph -
Returns:

GraphLab Project