me.jaimegarza.syntax.graph

Class KamadaKawai<T extends Node>

java.lang.Object

me.jaimegarza.syntax.graph.KamadaKawai<T>

Type Parameters:

T - is the type of node that this graph supports.

public class KamadaKawai<T extends Node>
extends Object

KamadaKawai algorithm for laying up a graph. It is done in iterations until a max number, or until a negligible change in E.

Based on the paper by Kamada and Kawai of 1988, "An alorithm for Drawing General Unidirected Graphs".

Although they specify a newton-raphson, I decided to iterate by observing E changes.

Author:

jgarza

Constructor Summary

Constructors

Constructor and Description
KamadaKawai(DirectedGraph<T> graph, int maxWidth, int maxHeight)

Method Summary

Modifier and Type	Method and Description
void	compute()
DijkstraShortestPath<T>	getShortestPath()
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

KamadaKawai

public KamadaKawai(DirectedGraph<T> graph,
                   int maxWidth,
                   int maxHeight)

Method Detail

compute

public void compute()

toString

public String toString()

Overrides:

toString in class Object

getShortestPath

public DijkstraShortestPath<T> getShortestPath()

Returns:

the shortestPath