Index: lemon/graph_adaptor.h
===================================================================
--- lemon/graph_adaptor.h (revision 2079)
+++ lemon/graph_adaptor.h (revision 2081)
@@ -42,5 +42,4 @@
///\brief Base type for the Graph Adaptors
- ///\ingroup graph_adaptors
///
///Base type for the Graph Adaptors
@@ -193,4 +192,10 @@
};
+ ///\ingroup graph_adaptors
+ ///
+ ///\brief Trivial Graph Adaptor
+ ///
+ /// This class is an adaptor which does not change the adapted graph.
+ /// It can be used only to test the graph adaptors.
template
class GraphAdaptor :
@@ -246,6 +251,7 @@
+ ///\ingroup graph_adaptors
+ ///
///\brief A graph adaptor which reverses the orientation of the edges.
- ///\ingroup graph_adaptors
///
/// If \c g is defined as
@@ -637,6 +643,7 @@
};
+ /// \ingroup graph_adaptors
+ ///
/// \brief A graph adaptor for hiding nodes and edges from a graph.
- /// \ingroup graph_adaptors
///
/// SubGraphAdaptor shows the graph with filtered node-set and
@@ -756,6 +763,7 @@
+ ///\ingroup graph_adaptors
+ ///
///\brief An adaptor for hiding nodes from a graph.
- ///\ingroup graph_adaptors
///
///An adaptor for hiding nodes from a graph.
@@ -810,4 +818,6 @@
}
+ ///\ingroup graph_adaptors
+ ///
///\brief An adaptor for hiding edges from a graph.
///
@@ -1228,6 +1238,7 @@
+ ///\ingroup graph_adaptors
+ ///
/// \brief An undirected graph is made from a directed graph by an adaptor
- /// \ingroup graph_adaptors
///
/// Undocumented, untested!!!
@@ -1366,8 +1377,8 @@
+ ///\ingroup graph_adaptors
+ ///
///\brief An adaptor for composing the residual
///graph for directed flow and circulation problems.
- ///
- ///\ingroup graph_adaptors
///
///An adaptor for composing the residual graph for directed flow and
@@ -1575,6 +1586,7 @@
+ ///\ingroup graph_adaptors
+ ///
///\brief For blocking flows.
- ///\ingroup graph_adaptors
///
///This graph adaptor is used for on-the-fly
@@ -2320,5 +2332,5 @@
/// \ingroup graph_adaptors
///
- /// \brief SplitGraphAdaptor class
+ /// \brief Split graph adaptor class
///
/// This is an graph adaptor which splits all node into an in-node
@@ -2376,4 +2388,5 @@
///
/// The second solution contains just 3 disjoint paths while the first 4.
+ /// The full code can be found in the \ref disjoint_paths.cc demo file.
///
/// This graph adaptor is fully conform to the