gov.nist.antd.merlin.algorithm.route.shortestpath.k
Class KspDisjoint.KGraph

java.lang.Object
  |
  +--gov.nist.antd.merlin.algorithm.route.util.Graph
        |
        +--gov.nist.antd.merlin.algorithm.route.shortestpath.k.KspDisjoint.KGraph

Enclosing class:

KspDisjoint

public class KspDisjoint.KGraph

extends Graph

KGraph adds a method deleteEdge and overides buildpath() to be able to delete edges in the graph as paths are constructed.

Field Summary

Fields inherited from class gov.nist.antd.merlin.algorithm.route.util.Graph

INFINITY, vertexMap

Constructor Summary

KspDisjoint.KGraph(Glass net)
constructor calls superclass constructor

Method Summary

void	buildPath(Vertex source, Vertex dest, java.util.Vector v) Recursive routine to build path to dest after running shortest path algorithm.
void	deleteEdge(ExtRouter source, ExtRouter dest) removes an edge from the graph

Methods inherited from class gov.nist.antd.merlin.algorithm.route.util.Graph

addEdge, clearAll, getVertex, printPath

Methods inherited from class java.lang.Object

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

Constructor Detail

KspDisjoint.KGraph

public KspDisjoint.KGraph(Glass net)

constructor calls superclass constructor

Parameters:

net -

Method Detail

deleteEdge

public void deleteEdge(ExtRouter source,
                       ExtRouter dest)

removes an edge from the graph

Parameters:

dest - is the end of edge

buildPath

public void buildPath(Vertex source,
                      Vertex dest,
                      java.util.Vector v)

Recursive routine to build path to dest after running shortest path algorithm. The path is known to exist.

Overrides:

buildPath in class Graph

Parameters:

source - The source vertex.

dest - The destination vertex

v - The vector where the path is stored.