es.tid.pce.computingEngine.algorithms.sson

Class ModifiedDijkstraSP

java.lang.Object

es.tid.pce.computingEngine.algorithms.sson.ModifiedDijkstraSP

public class ModifiedDijkstraSP
extends Object

An implementation of Dijkstra's shortest path algorithm using ClosestFirstIterator.

Since:

Sep 2, 2003

Author:

John V. Sichi

Constructor Summary

Constructors

Constructor and Description
ModifiedDijkstraSP(org.jgrapht.graph.SimpleDirectedWeightedGraph<Object,es.tid.tedb.IntraDomainEdge> graph, Object startVertex, Object endVertex, ArrayList<es.tid.ospf.ospfv2.lsa.tlv.subtlv.complexFields.BitmapLabelSet> SetChannels, int num_slots) Creates and executes a new DijkstraShortestPath algorithm instance.
ModifiedDijkstraSP(org.jgrapht.graph.SimpleDirectedWeightedGraph<Object,es.tid.tedb.IntraDomainEdge> graph, Object startVertex, Object endVertex, double radius, ArrayList<es.tid.ospf.ospfv2.lsa.tlv.subtlv.complexFields.BitmapLabelSet> SetChannels, int num_slots) Creates and executes a new DijkstraShortestPath algorithm instance.

Method Summary

Modifier and Type	Method and Description
static List<es.tid.tedb.IntraDomainEdge>	findPathBetween(org.jgrapht.graph.SimpleDirectedWeightedGraph<Object,es.tid.tedb.IntraDomainEdge> graph, Object startVertex, Object endVertex) Convenience method to find the shortest path via a single static method call.
org.jgrapht.GraphPath<Object,es.tid.tedb.IntraDomainEdge>	getPath() Return the path found.
List<es.tid.tedb.IntraDomainEdge>	getPathEdgeList() Return the edges making up the path found.
double	getPathLength() Return the length of the path found.
Hashtable<Object,BitmapChannelState>	getVertexSpectrumState()

Methods inherited from class java.lang.Object

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

Constructor Detail

ModifiedDijkstraSP

public ModifiedDijkstraSP(org.jgrapht.graph.SimpleDirectedWeightedGraph<Object,es.tid.tedb.IntraDomainEdge> graph,
                          Object startVertex,
                          Object endVertex,
                          ArrayList<es.tid.ospf.ospfv2.lsa.tlv.subtlv.complexFields.BitmapLabelSet> SetChannels,
                          int num_slots)

Creates and executes a new DijkstraShortestPath algorithm instance. An instance is only good for a single search; after construction, it can be accessed to retrieve information about the path found.

Parameters:

graph - the graph to be searched

startVertex - the vertex at which the path should start

endVertex - the vertex at which the path should end

SetChannels - SetChannels

num_slots - num_slots

ModifiedDijkstraSP

public ModifiedDijkstraSP(org.jgrapht.graph.SimpleDirectedWeightedGraph<Object,es.tid.tedb.IntraDomainEdge> graph,
                          Object startVertex,
                          Object endVertex,
                          double radius,
                          ArrayList<es.tid.ospf.ospfv2.lsa.tlv.subtlv.complexFields.BitmapLabelSet> SetChannels,
                          int num_slots)

Creates and executes a new DijkstraShortestPath algorithm instance. An instance is only good for a single search; after construction, it can be accessed to retrieve information about the path found.

Parameters:

graph - the graph to be searched

startVertex - the vertex at which the path should start

endVertex - the vertex at which the path should end

radius - limit on path length, or Double.POSITIVE_INFINITY for unbounded search

SetChannels - SetChannels

num_slots - num_slots

Method Detail

getPathEdgeList

public List<es.tid.tedb.IntraDomainEdge> getPathEdgeList()

Return the edges making up the path found.

Returns:

List of Edges, or null if no path exists

getPath

public org.jgrapht.GraphPath<Object,es.tid.tedb.IntraDomainEdge> getPath()

Return the path found.

Returns:

path representation, or null if no path exists

getPathLength

public double getPathLength()

Return the length of the path found.

Returns:

path length, or Double.POSITIVE_INFINITY if no path exists

findPathBetween

public static List<es.tid.tedb.IntraDomainEdge> findPathBetween(org.jgrapht.graph.SimpleDirectedWeightedGraph<Object,es.tid.tedb.IntraDomainEdge> graph,
                                                                Object startVertex,
                                                                Object endVertex)

Convenience method to find the shortest path via a single static method call. If you need a more advanced search (e.g. limited by radius, or computation of the path length), use the constructor instead.

Parameters:

graph - the graph to be searched

startVertex - the vertex at which the path should start

endVertex - the vertex at which the path should end

Returns:

List of Edges, or null if no path exists

getVertexSpectrumState

public Hashtable<Object,BitmapChannelState> getVertexSpectrumState()