COIN-OR::LEMON - Graph Library

Changeset 2081:94a7deb46c07 in lemon-0.x for lemon


Ignore:
Timestamp:
05/12/06 17:29:42 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2744
Message:

New demo file for computing disjoint paths

Doc review

Correcting misformatting in adaptors
Adding header to demos

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/graph_adaptor.h

    r2079 r2081  
    4242
    4343  ///\brief Base type for the Graph Adaptors
    44   ///\ingroup graph_adaptors
    4544  ///
    4645  ///Base type for the Graph Adaptors
     
    193192  };
    194193
     194  ///\ingroup graph_adaptors
     195  ///
     196  ///\brief Trivial Graph Adaptor
     197  ///
     198  /// This class is an adaptor which does not change the adapted graph.
     199  /// It can be used only to test the graph adaptors.
    195200  template <typename _Graph>
    196201  class GraphAdaptor :
     
    246251   
    247252
     253  ///\ingroup graph_adaptors
     254  ///
    248255  ///\brief A graph adaptor which reverses the orientation of the edges.
    249   ///\ingroup graph_adaptors
    250256  ///
    251257  /// If \c g is defined as
     
    637643  };
    638644
     645  /// \ingroup graph_adaptors
     646  ///
    639647  /// \brief A graph adaptor for hiding nodes and edges from a graph.
    640   /// \ingroup graph_adaptors
    641648  ///
    642649  /// SubGraphAdaptor shows the graph with filtered node-set and
     
    756763
    757764
     765  ///\ingroup graph_adaptors
     766  ///
    758767  ///\brief An adaptor for hiding nodes from a graph.
    759   ///\ingroup graph_adaptors
    760768  ///
    761769  ///An adaptor for hiding nodes from a graph.
     
    810818  }
    811819
     820  ///\ingroup graph_adaptors
     821  ///
    812822  ///\brief An adaptor for hiding edges from a graph.
    813823  ///
     
    12281238
    12291239
     1240  ///\ingroup graph_adaptors
     1241  ///
    12301242  /// \brief An undirected graph is made from a directed graph by an adaptor
    1231   /// \ingroup graph_adaptors
    12321243  ///
    12331244  /// Undocumented, untested!!!
     
    13661377
    13671378 
     1379  ///\ingroup graph_adaptors
     1380  ///
    13681381  ///\brief An adaptor for composing the residual
    13691382  ///graph for directed flow and circulation problems.
    1370   ///
    1371   ///\ingroup graph_adaptors
    13721383  ///
    13731384  ///An adaptor for composing the residual graph for directed flow and
     
    15751586
    15761587
     1588  ///\ingroup graph_adaptors
     1589  ///
    15771590  ///\brief For blocking flows.
    1578   ///\ingroup graph_adaptors
    15791591  ///
    15801592  ///This graph adaptor is used for on-the-fly
     
    23202332  /// \ingroup graph_adaptors
    23212333  ///
    2322   /// \brief SplitGraphAdaptor class
     2334  /// \brief Split graph adaptor class
    23232335  ///
    23242336  /// This is an graph adaptor which splits all node into an in-node
     
    23762388  ///
    23772389  /// The second solution contains just 3 disjoint paths while the first 4.
     2390  /// The full code can be found in the \ref disjoint_paths.cc demo file.
    23782391  ///
    23792392  /// This graph adaptor is fully conform to the
Note: See TracChangeset for help on using the changeset viewer.