#include <SinglePairShortestPath.h>

Inheritance diagram for SinglePairShortestPath:

Collaboration diagram for SinglePairShortestPath:

Public Member Functions
virtual sparksee::gdb::OIDList *	GetPathAsNodes ()=0
	Gets the shortest path between the source node and the destination node as an ordered set of nodes.
virtual sparksee::gdb::OIDList *	GetPathAsEdges ()=0
	Gets the shortest path between the source node and the destination node as an ordered set of edges.
virtual sparksee::gdb::double64_t	GetCost ()=0
	Gets the cost of the shortest path.
virtual sparksee::gdb::bool_t	Exists ()
	Returns TRUE If a path exists or FALSE otherwise.
virtual	~SinglePairShortestPath ()
	Destructor.
void	SetMaximumHops (sparksee::gdb::int32_t maxhops)
	Sets the maximum hops restriction.
virtual void	AddEdgeType (sparksee::gdb::type_t type, sparksee::gdb::EdgesDirection dir)
	Allows for traversing edges of the given type.
virtual void	AddAllEdgeTypes (sparksee::gdb::EdgesDirection dir)
	Allows for traversing all edge types of the graph.
virtual void	AddNodeType (sparksee::gdb::type_t type)
	Allows for traversing nodes of the given type.
virtual void	AddAllNodeTypes ()
	Allows for traversing all node types of the graph.
virtual void	ExcludeNodes (sparksee::gdb::Objects &nodes)
	Set which nodes can't be used.
virtual void	ExcludeEdges (sparksee::gdb::Objects &edges)
	Set which edges can't be used.
virtual void	Run ()=0
	Runs the algorithm.

Protected Member Functions
	SinglePairShortestPath (sparksee::gdb::Session &s, sparksee::gdb::oid_t src, sparksee::gdb::oid_t dst)
	Creates a new instance.
void	AssertEdgeType (sparksee::gdb::type_t edgetype)
	Check that the given edge type is valid.
void	AssertAddedEdges ()
	Check that edges had been added.
void	AssertAddedNodes ()
	Check that nodes had been added.
void	AssertNodeType (sparksee::gdb::type_t nodetype)
	Check that the given node type is valid.
sparksee::gdb::bool_t	IsNodeTypeAllowed (sparksee::gdb::oid_t nodeId)
	Check if the given node has an allowed type.
void	AssertNotComputed ()
	Check that the shortest path had not been calculated yet.
void	AssertComputed ()
	Check that the shortest path had been calculated.
sparksee::gdb::bool_t	IsNodeExcluded (sparksee::gdb::oid_t node)
	Check if the given node is forbidden.
sparksee::gdb::bool_t	IsEdgeExcluded (sparksee::gdb::oid_t edge)
	Check if the given edge is forbidden.

Protected Attributes
sparksee::gdb::oid_t	source
	Source node.
sparksee::gdb::oid_t	destination
	Destination node.
sparksee::gdb::OIDList *	pathAsNodes
	Ordered set of node identifiers representing the shortest path.
sparksee::gdb::OIDList *	pathAsEdges
	Ordered set of edge identifiers representing the shortest path.
sparksee::gdb::Session *	sess
	Session.
sparksee::gdb::Graph *	graph
	Graph.
std::map< sparksee::gdb::type_t, sparksee::gdb::EdgesDirection >	edgeTypes
	Allowed edge types.
std::vector< sparksee::gdb::type_t >	nodeTypes
	Allowed node types.
sparksee::gdb::int32_t	maxHops
	Maximum hops restriction.
sparksee::gdb::bool_t	computed
	True if the shortest path has been calculated.
sparksee::gdb::Objects *	excludedNodes
	The set of excluded nodes.
sparksee::gdb::Objects *	excludedEdges
	The set of excluded edges.
sparksee::gdb::bool_t	areAllNodeTypesAllowed
	True if all the node types are allowed.

Detailed Description

SinglePairShortestPath class.

Classes implementing this abstract class solve the shortest path problem in a graph from a given source node and to a given destination node.

Check out the 'Algorithms' section in the SPARKSEE User Manual for more details on this.

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

Constructor & Destructor Documentation

◆ SinglePairShortestPath()

SinglePairShortestPath::SinglePairShortestPath	(	sparksee::gdb::Session &	s,
		sparksee::gdb::oid_t	src,
		sparksee::gdb::oid_t	dst )

protected

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

◆ AddAllEdgeTypes()

virtual void ShortestPath::AddAllEdgeTypes ( sparksee::gdb::EdgesDirection dir )

virtualinherited

Allows for traversing all edge types of the graph.

Parameters

dir	[in] Edge direction.

◆ AddEdgeType()

virtual void ShortestPath::AddEdgeType	(	sparksee::gdb::type_t	type,
		sparksee::gdb::EdgesDirection	dir )

virtualinherited

Allows for traversing edges of the given type.

Parameters

type	[in] Edge type.
dir	[in] Edge direction.

◆ ExcludeEdges()

virtual void ShortestPath::ExcludeEdges ( sparksee::gdb::Objects & edges )

virtualinherited

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.

◆ ExcludeNodes()

virtual void ShortestPath::ExcludeNodes ( sparksee::gdb::Objects & nodes )

virtualinherited

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.

◆ GetCost()

virtual sparksee::gdb::double64_t SinglePairShortestPath::GetCost ( )

pure virtual

Gets the cost of the shortest path.

The cost for unweighted algorithms is the number of hops of the shortest path. For weighted algoritms, the cost is the sum of the costs of the edges of the shortest path.

Returns: The cost of the shortest path.

Implemented in SinglePairShortestPathBFS, and SinglePairShortestPathDijkstra.

◆ GetPathAsEdges()

virtual sparksee::gdb::OIDList * SinglePairShortestPath::GetPathAsEdges ( )

pure virtual

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

Returns: Ordered set of edge identifiers.

Implemented in SinglePairShortestPathBFS, and SinglePairShortestPathDijkstra.

◆ GetPathAsNodes()

virtual sparksee::gdb::OIDList * SinglePairShortestPath::GetPathAsNodes ( )

pure virtual

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

Returns: Ordered set of node identifiers.

Implemented in SinglePairShortestPathBFS, and SinglePairShortestPathDijkstra.

◆ Run()

virtual void ShortestPath::Run ( )

pure virtualinherited

Runs the algorithm.

This method can only be called once.

Implemented in SinglePairShortestPathBFS, and SinglePairShortestPathDijkstra.

◆ SetMaximumHops()

void ShortestPath::SetMaximumHops ( sparksee::gdb::int32_t maxhops )

inherited

Sets the maximum hops restriction.

All paths longer than the maximum hops restriction will be ignored.

Parameters

maxhops [in] The maximum hops restriction. It must be positive or zero. Zero, the default value, means unlimited.

Member Data Documentation

◆ maxHops

sparksee::gdb::int32_t ShortestPath::maxHops

protectedinherited

Maximum hops restriction.

It must be positive or zero. Zero means unlimited.

◆ pathAsEdges

sparksee::gdb::OIDList* SinglePairShortestPath::pathAsEdges

protected

Ordered set of edge identifiers representing the shortest path.

May be computed lazily when requested from the pathAsNodes.

The documentation for this class was generated from the following file:

SinglePairShortestPath.h

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

◆ SinglePairShortestPath()

Member Function Documentation

◆ AddAllEdgeTypes()

◆ AddEdgeType()

◆ ExcludeEdges()

◆ ExcludeNodes()

◆ GetCost()

◆ GetPathAsEdges()

◆ GetPathAsNodes()

◆ Run()

◆ SetMaximumHops()

Member Data Documentation

◆ maxHops

◆ pathAsEdges