EdgeSubGraph< Graph > Class Template Reference
[Semi-Adaptor Classes for Graphs]

---

Detailed Description

template<typename Graph>
class lemon::EdgeSubGraph< Graph >

Graph which uses a subset of another graph's edges. This class is an alternative to the EdgeSubGraphAdaptor which is created for the same reason. The main difference between the two class that it makes linked lists on the unhidden edges what cause that on sparse subgraphs the algorithms can be more efficient and some times provide better time complexity. On other way this implemetation is less efficient in most case when the subgraph filters out only a few edges.

See also:

EdgeSubGraphAdaptor

EdgeSubGraphBase

#include <lemon/sub_graph.h>

Inheritance diagram for EdgeSubGraph< Graph >:

[legend]

List of all members.

Public Member Functions
	EdgeSubGraph (const Graph &_graph)
	Constructor for sub-graph.

---

Constructor & Destructor Documentation

EdgeSubGraph

(

const Graph &

_graph

)

[inline]

Constructor for sub-graph. Initially all the edges are hidden in the graph.