dyng::detail::mapped_graph Class Reference

Wrapper class for graph used to represent graph partitioning. More...

#include <mapped_graph.h>

Public Member Functions
	mapped_graph (graph_partitioning g)
const graph_partitioning &	graph () const
graph_partitioning &	graph ()
node_partition &	node_at (node_id id)
const node_partition &	node_at (node_id id) const
edge_partition &	edge_at (edge_id id)
const edge_partition &	edge_at (edge_id id) const
void	map_node (node_id node, node_id target)
void	map_edge (edge_id edge, edge_id target)
void	clear_nodes ()
void	clear_edges ()

Detailed Description

Wrapper class for graph used to represent graph partitioning.

Enables multiple ids to point to the same node/edge. Used internally in foresighted_layout.

node_at and edge_at both return either node / edge returned by graph::node_at / graph::edge_at or the associated node/edge that has been associated to another node / edge in the graph by the method map_node / map_edge.

See also

graph, foresighted_layout

Member Function Documentation

map_edge()

void dyng::detail::mapped_graph::map_edge ( edge_id  edge, edge_id  target  )

inline

Associates another edge_id with an edge of target id. Used for partitioning a graph.

Parameters

edge	Id to assign to the target id.
target	The target id.

Exceptions

std::out_of_range

If edge_id is invalid.

map_node()

void dyng::detail::mapped_graph::map_node ( node_id  node, node_id  target  )

inline

Associates another node_id with a node of target id. Used for partitioning a graph.

Parameters

node	Id to assign to the target id.
target	The target id.

Exceptions

std::out_of_range

If node_id is invalid.

---

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

• mapped_graph.h