GraphLab Project

graphlab.library.algorithms.shortestpath
Class Johnson<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>

java.lang.Object
  extended by graphlab.library.algorithms.Algorithm
      extended by graphlab.library.algorithms.shortestpath.Johnson<VertexType,EdgeType,GraphType>
All Implemented Interfaces:
AlgorithmInterface

public class Johnson<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
extends Algorithm

This Algorithm computes the lenght of the shortest path between any two arbitrary vertices. This method is usually used for sparse graphs.

Author:
Soroush Sabet

Method Summary
 int[][] ComputePaths(GraphType g)
           
 
Methods inherited from class graphlab.library.algorithms.Algorithm
acceptEventDispatcher, dispatchEvent, getDispatcher
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Method Detail

ComputePaths

public int[][] ComputePaths(GraphType g)

GraphLab Project