DexNet 4.7.0
Public Member Functions
com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra Class Reference

SinglePairShortestPathDijkstra class. More...

Inheritance diagram for com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra:
Inheritance graph
Collaboration diagram for com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra:
Collaboration graph

List of all members.

Public Member Functions

bool Exists ()
 Returns TRUE If a path exists or FALSE otherwise.
void AddWeightedEdgeType (int t, com.sparsity.dex.gdb.EdgesDirection d, int attr)
 Allows for traversing edges of the given type using the given attribute as the weight.
com.sparsity.dex.gdb.OIDList GetPathAsEdges ()
 Gets the shortest path between the source node and the destination node as an ordered set of edges.
com.sparsity.dex.gdb.OIDList GetPathAsNodes ()
 Gets the shortest path between the source node and the destination node as an ordered set of nodes.
void AddEdgeType (int t, com.sparsity.dex.gdb.EdgesDirection d)
 Allows for traversing edges of the given type.
void AddNodeType (int t)
 Allows for traversing nodes of the given type.
double GetCost ()
 Gets the cost of the shortest path.
void ExcludeEdges (com.sparsity.dex.gdb.Objects edges)
 Set which edges can't be used.
void AddAllNodeTypes ()
 Allows for traversing all node types of the graph.
void AddAllEdgeTypes (com.sparsity.dex.gdb.EdgesDirection d)
 Allows for traversing all edge types of the graph.
void ExcludeNodes (com.sparsity.dex.gdb.Objects nodes)
 Set which nodes can't be used.
void Run ()
 Executes the algorithm.
 SinglePairShortestPathDijkstra (com.sparsity.dex.gdb.Session s, long src, long dst)
 Creates a new instance.
void SetUnweightedEdgeCost (double weight)
 Sets the weight assigned to the unweighted edges.
void SetMaximumHops (int maxhops)
 Sets the maximum hops restriction.
boolean IsClosed ()
 Gets if ShortestPath instance has been closed or not.
void Close ()
 Closes the ShortestPath instance.

Detailed Description

SinglePairShortestPathDijkstra class.

It solves the single-pair shortest path problem using a Dijkstra-based implementation.

It is a weighted algorithm, so it takes into account the cost of the edges to compute a minimum-cost shortest path. That is, the user may set for each edge type which attribute should be used to retrieve the cost of the edge. If no attribute is given for an edge type, this will assume the edge has a fixed cost (the default is 1). Only numerical attribute can be set as weight attributes (that is Long, Integer or Double attributes are allowed).

Author:
Sparsity Technologies http://www.sparsity-technologies.com

Constructor & Destructor Documentation

com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::SinglePairShortestPathDijkstra ( com.sparsity.dex.gdb.Session  s,
long  src,
long  dst 
)

Creates a new instance.

Parameters:
s[in] Session to get the graph from and perform traversal.
src[in] Source node.
dst[dst] Destination node.

Member Function Documentation

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::AddAllEdgeTypes ( com.sparsity.dex.gdb.EdgesDirection  d)

Allows for traversing all edge types of the graph.

Parameters:
d[in] Edge direction.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::AddEdgeType ( int  t,
com.sparsity.dex.gdb.EdgesDirection  d 
)

Allows for traversing edges of the given type.

Parameters:
t[in] Edge type.
d[in] Edge direction.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::AddNodeType ( int  t)

Allows for traversing nodes of the given type.

Parameters:
tnull

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::AddWeightedEdgeType ( int  t,
com.sparsity.dex.gdb.EdgesDirection  d,
int  attr 
)

Allows for traversing edges of the given type using the given attribute as the weight.

Parameters:
t[in] Edge type.
d[in] Edge direction.
attr[in] Attribute to be used as the weight. It must be a global attribute or an attribute of the given edge type.
void com::sparsity::dex::algorithms::ShortestPath::Close ( ) [inherited]

Closes the ShortestPath instance.

It must be called to ensure the integrity of all data.

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::ExcludeEdges ( com.sparsity.dex.gdb.Objects  edges)

Set which edges can't be used.

This will replace any previously specified set of excluded edges. Should only be used to exclude the usage of specific edges from allowed edge types because it's less efficient than not allowing an edge type.

Parameters:
edges[in] A set of edge identifiers that must be kept intact until the destruction of the class.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::ExcludeNodes ( com.sparsity.dex.gdb.Objects  nodes)

Set which nodes can't be used.

This will replace any previously specified set of excluded nodes. Should only be used to exclude the usage of specific nodes from allowed node types because it's less efficient than not allowing a node type.

Parameters:
nodes[in] A set of node identifiers that must be kept intact until the destruction of the class.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

double com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::GetCost ( )

Gets the cost of the shortest path.

The cost is the sum of the weights of the edges in the shortest path.

Returns:
The cost of the shortest path.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

com.sparsity.dex.gdb.OIDList com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::GetPathAsEdges ( )

Gets the shortest path between the source node and the destination node as an ordered set of edges.

Returns:
Ordered set of edge identifiers.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

com.sparsity.dex.gdb.OIDList com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::GetPathAsNodes ( )

Gets the shortest path between the source node and the destination node as an ordered set of nodes.

Returns:
Ordered set of node identifiers.

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

boolean com::sparsity::dex::algorithms::ShortestPath::IsClosed ( ) [inherited]

Gets if ShortestPath instance has been closed or not.

See also:
Close()
Returns:
TRUE if the ShortestPath instance has been closed, FALSE otherwise.
void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::SetMaximumHops ( int  maxhops)

Sets the maximum hops restriction.

All paths longer than the maximum hops restriction will be ignored. m[in] The maximum hops restriction. It must be positive or zero. Zero, the default value, means unlimited.

Parameters:
maxhopsnull

Reimplemented from com::sparsity::dex::algorithms::SinglePairShortestPath.

void com::sparsity::dex::algorithms::SinglePairShortestPathDijkstra::SetUnweightedEdgeCost ( double  weight)

Sets the weight assigned to the unweighted edges.

All the edges from the types added without an explicit weight attribute will get this weight. The default weight for this edges is 1.

Parameters:
weightnull