Package drcl.net.graph

Class Summary

AdjMatrixVis
Area
Graph
Link	The class defines data structure that describes an "edge" of a graph.
Node
Relaxer	Given a graph, iterates to get to the equilibrium point where forces by edge length and "push" by nodes are balanced.
ShortestPathTree	This class implements the Dijkstra algorithm and calculates the minimum shortest path tree for a graph.
TopologyParser	Converts an adjacency matrix to topology data structure.
TopologyReader	Reads topology from a file and saves in Graph.
TopologyReaderAlt
TopologyReaderBrite
TopologyVisRelaxer	Plots the graph changed by Relaxer.