Loading...
Searching...
No Matches
graph.hh File Reference
Iterative Solvers Template Library (ISTL) » Iterative Solvers » Preconditioners » Parallel Algebraic Multigrid

Provides classes for building the matrix graph. More...

`#include <cstddef>`
`#include <algorithm>`
`#include <vector>`
`#include <cassert>`
`#include <limits>`
`#include <dune/common/typetraits.hh>`
`#include <dune/common/iteratorfacades.hh>`
`#include <dune/istl/istlexception.hh>`
`#include <dune/common/propertymap.hh>`

Go to the source code of this file.

## Classes

class | Dune::Amg::MatrixGraph< M >
| The (undirected) graph of a matrix. More...
class | Dune::Amg::MatrixGraph< M >::EdgeIteratorT< C >
| Iterator over all edges starting from a vertex. More...
class | Dune::Amg::MatrixGraph< M >::VertexIteratorT< C >
| The vertex iterator type of the graph. More...
class | Dune::Amg::SubGraph< G, T >
| A subgraph of a graph. More...
class | Dune::Amg::SubGraph< G, T >::EdgeIndexMap
| An index map for mapping the edges to indices. More...
class | Dune::Amg::SubGraph< G, T >::EdgeIterator
| The edge iterator of the graph. More...
class | Dune::Amg::SubGraph< G, T >::VertexIterator
| The vertex iterator of the graph. More...
class | Dune::Amg::VertexPropertiesGraph< G, VP, VM >
| Attaches properties to the vertices of a graph. More...
class | Dune::Amg::VertexPropertiesGraph< G, VP, VM >::VertexIteratorT< C >
class | Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM >
| Attaches properties to the edges and vertices of a graph. More...
class | Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM >::EdgeIteratorT< C >
class | Dune::Amg::PropertiesGraph< G, VP, EP, VM, EM >::VertexIteratorT< C >
class | Dune::Amg::GraphVertexPropertiesSelector< G >
| Wrapper to access the internal edge properties of a graph via operator[](). More...
class | Dune::Amg::GraphEdgePropertiesSelector< G >
| Wrapper to access the internal vertex properties of a graph via operator[](). More...

## Namespaces

namespace | Dune
namespace | Dune::Amg

## Functions

template<class G, class V>
int | Dune::Amg::visitNeighbours (const G &graph, const typename G::VertexDescriptor &vertex, V &visitor)
| Visit all neighbour vertices of a vertex in a graph.

## Detailed Description

Provides classes for building the matrix graph.

Author
  Markus Blatt

During the coarsening process in AMG the matrix graph together with the dependencies, what connections in the graph are considered strong or weak, what vertices are isolated, etc., have to build. This information will be contained in the MatrixGraph class.