COIN-OR::LEMON - Graph Library

Changeset 879:5e284075b193 in lemon-0.x


Ignore:
Timestamp:
09/17/04 17:11:39 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1187
Message:

An alert added to doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/graph_wrapper.h

    r878 r879  
    8181  ///Base type for the Graph Wrappers
    8282
     83  ///\warning Graph wrappers are in even more experimental state than the other
     84  ///parts of the lib. Use them at you own risk.
     85  ///
    8386  ///This is the base type for the Graph Wrappers.
    8487  ///\todo Some more docs...
     
    215218  /// A graph wrapper which reverses the orientation of the edges.
    216219
     220  ///\warning Graph wrappers are in even more experimental state than the other
     221  ///parts of the lib. Use them at you own risk.
     222  ///
    217223  /// A graph wrapper which reverses the orientation of the edges.
    218224  /// Thus \c Graph have to be a directed graph type.
     
    289295  /// A graph wrapper for hiding nodes and edges from a graph.
    290296 
     297  ///\warning Graph wrappers are in even more experimental state than the other
     298  ///parts of the lib. Use them at you own risk.
     299  ///
    291300  /// This wrapper shows a graph with filtered node-set and
    292301  /// edge-set. Given a bool-valued map on the node-set and one on
     
    556565  /// \brief An undirected graph template.
    557566  ///
     567  ///\warning Graph wrappers are in even more experimental state than the other
     568  ///parts of the lib. Use them at you own risk.
     569  ///
    558570  /// An undirected graph template.
    559571  /// This class works as an undirected graph and a directed graph of
     
    577589  ///\brief A wrapper for composing a subgraph of a
    578590  /// bidirected graph made from a directed one.
     591  ///
     592  ///\warning Graph wrappers are in even more experimental state than the other
     593  ///parts of the lib. Use them at you own risk.
    579594  ///
    580595  /// Suppose that for a directed graph $G=(V, A)$,
     
    916931  ///\brief A wrapper for composing bidirected graph from a directed one.
    917932  ///
     933  ///\warning Graph wrappers are in even more experimental state than the other
     934  ///parts of the lib. Use them at you own risk.
     935  ///
    918936  /// A wrapper for composing bidirected graph from a directed one.
    919937  /// A bidirected graph is composed over the directed one without physical
     
    954972  /// \brief A bidirected graph template.
    955973  ///
     974  ///\warning Graph wrappers are in even more experimental state than the other
     975  ///parts of the lib. Use them at you own risk.
     976  ///
    956977  /// A bidirected graph template.
    957978  /// Such a bidirected graph stores each pair of oppositely directed edges
     
    10141035  /// A wrapper for composing the residual graph for directed flow and circulation problems.
    10151036
     1037  ///\warning Graph wrappers are in even more experimental state than the other
     1038  ///parts of the lib. Use them at you own risk.
     1039  ///
    10161040  /// A wrapper for composing the residual graph for directed flow and circulation problems.
    10171041  template<typename Graph, typename Number,
     
    10891113  /// For blocking flows.
    10901114
     1115  ///\warning Graph wrappers are in even more experimental state than the other
     1116  ///parts of the lib. Use them at you own risk.
     1117  ///
    10911118  /// This graph wrapper is used for on-the-fly
    10921119  /// Dinits blocking flow computations.
Note: See TracChangeset for help on using the changeset viewer.