Composite Graph as a wrapper of network graph and dummy graph. More...

Public Member Functions
	CompositeGraph (const NETWORK::NetworkGraph &g, const DummyGraph &dg)
	Constructor. More...

unsigned int	get_dummy_node_start_index () const
	Get the starting node index corresponding to the the first dummy node in the dummy graph.

int	get_edge_index (NETWORK::NodeIndex u, NETWORK::NodeIndex v, double cost) const
	Get edge index from node index u,v and cost. More...

NETWORK::EdgeID	get_edge_id (NETWORK::NodeIndex u, NETWORK::NodeIndex v, double cost) const
	Get edge id from node index u,v and cost.

std::vector< CompEdgeProperty >	out_edges (NETWORK::NodeIndex u) const
	Get out edges leaving a node u in the composite graph.

bool	check_dummy_node (NETWORK::NodeIndex u) const
	Check if a node u is dummy node, namely representing a candidate point.

Detailed Description

Composite Graph as a wrapper of network graph and dummy graph.

Definition at line 136 of file composite_graph.hpp.

Constructor & Destructor Documentation

CompositeGraph::CompositeGraph	(	const NETWORK::NetworkGraph &	g,
		const DummyGraph &	dg
	)

Constructor.

Parameters

g	A network graph
dg	A dummy graph

Definition at line 123 of file composite_graph.cpp.

int CompositeGraph::get_edge_index	(	NETWORK::NodeIndex	u,
		NETWORK::NodeIndex	v,
		double	cost
	)		const

Get edge index from node index u,v and cost.

If edge is not found, -1 is returned.

Definition at line 132 of file composite_graph.cpp.

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