Dune::Amg::SubGraph< G, T > Class Template Reference
[Parallel Algebraic Multigrid]

#include <graph.hh>

List of all members.


Detailed Description

template<class G, class T>
class Dune::Amg::SubGraph< G, T >

A subgraph of a graph.

This is a (cached) view of a graph where certain vertices and edges pointing to and leading from them are skipped.

The vertex descriptors are not changed.


Public Types

typedef G Graph
 The type of the graph we are a sub graph for.
typedef T Excluded
 Random access container providing information about which vertices are excluded.
typedef Graph::VertexDescriptor VertexDescriptor
 The vertex descriptor.
typedef EdgeIterator ConstEdgeIterator
 The constant edge iterator type.
typedef VertexIterator ConstVertexIterator
 The constant vertex iterator type.

Public Member Functions

EdgeIndexMap getEdgeIndexMap ()
 Get an edge index map for the graph.
ConstVertexIterator begin () const
 Get an iterator over the vertices.
ConstVertexIterator end () const
 Get an iterator over the vertices.
ConstEdgeIterator beginEdges (const VertexDescriptor &source) const
 Get an iterator over the edges starting at a vertex.
ConstEdgeIterator endEdges (const VertexDescriptor &source) const
 Get an iterator over the edges starting at a vertex.
int noVertices () const
 Get the number of vertices in the graph.
VertexDescriptor maxVertex () const
 Get the maximal vertex descriptor.
int noEdges () const
 Get the number of edges in the graph.
const EdgeDescriptor & findEdge (const VertexDescriptor &source, const VertexDescriptor &target) const
 Find the descriptor of an edge.
 SubGraph (const Graph &graph, const T &excluded)
 Constructor.
 ~SubGraph ()
 Destructor.

Classes

class  EdgeIndexMap
 An index map for mapping the edges to indices. More...
class  EdgeIterator
 The edge iterator of the graph. More...
class  VertexIterator
 The vertex iterator of the graph. More...

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

Generated on 12 Dec 2007 with Doxygen (ver 1.5.1)