COIN-OR::LEMON - Graph Library

Changeset 2429:fd51b552bcf2 in lemon-0.x for lemon/topology.h


Ignore:
Timestamp:
04/20/07 16:49:21 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3265
Message:

Renaming topology doxygen group

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/topology.h

    r2421 r2429  
    3636#include <functional>
    3737
    38 /// \ingroup topology
     38/// \ingroup graph_prop
    3939/// \file
    4040/// \brief Topology related algorithms
     
    4444namespace lemon {
    4545
    46   /// \ingroup topology
     46  /// \ingroup graph_prop
    4747  ///
    4848  /// \brief Check that the given undirected graph is connected.
     
    6767  }
    6868
    69   /// \ingroup topology
     69  /// \ingroup graph_prop
    7070  ///
    7171  /// \brief Count the number of connected components of an undirected graph
     
    109109  }
    110110
    111   /// \ingroup topology
     111  /// \ingroup graph_prop
    112112  ///
    113113  /// \brief Find the connected components of an undirected graph
     
    232232
    233233
    234   /// \ingroup topology
     234  /// \ingroup graph_prop
    235235  ///
    236236  /// \brief Check that the given directed graph is strongly connected.
     
    288288  }
    289289
    290   /// \ingroup topology
     290  /// \ingroup graph_prop
    291291  ///
    292292  /// \brief Count the strongly connected components of a directed graph
     
    352352  }
    353353
    354   /// \ingroup topology
     354  /// \ingroup graph_prop
    355355  ///
    356356  /// \brief Find the strongly connected components of a directed graph
     
    422422  }
    423423
    424   /// \ingroup topology
     424  /// \ingroup graph_prop
    425425  ///
    426426  /// \brief Find the cut edges of the strongly connected components.
     
    706706  int countBiNodeConnectedComponents(const UGraph& graph);
    707707
    708   /// \ingroup topology
     708  /// \ingroup graph_prop
    709709  ///
    710710  /// \brief Checks the graph is bi-node-connected.
     
    722722  }
    723723
    724   /// \ingroup topology
     724  /// \ingroup graph_prop
    725725  ///
    726726  /// \brief Count the biconnected components.
     
    757757  }
    758758
    759   /// \ingroup topology
     759  /// \ingroup graph_prop
    760760  ///
    761761  /// \brief Find the bi-node-connected components.
     
    803803  }
    804804
    805   /// \ingroup topology
     805  /// \ingroup graph_prop
    806806  ///
    807807  /// \brief Find the bi-node-connected cut nodes.
     
    10331033  int countBiEdgeConnectedComponents(const UGraph& graph);
    10341034
    1035   /// \ingroup topology
     1035  /// \ingroup graph_prop
    10361036  ///
    10371037  /// \brief Checks that the graph is bi-edge-connected.
     
    10491049  }
    10501050
    1051   /// \ingroup topology
     1051  /// \ingroup graph_prop
    10521052  ///
    10531053  /// \brief Count the bi-edge-connected components.
     
    10841084  }
    10851085
    1086   /// \ingroup topology
     1086  /// \ingroup graph_prop
    10871087  ///
    10881088  /// \brief Find the bi-edge-connected components.
     
    11291129  }
    11301130
    1131   /// \ingroup topology
     1131  /// \ingroup graph_prop
    11321132  ///
    11331133  /// \brief Find the bi-edge-connected cut edges.
     
    11931193  }
    11941194
    1195   /// \ingroup topology
     1195  /// \ingroup graph_prop
    11961196  ///
    11971197  /// \brief Sort the nodes of a DAG into topolgical order.
     
    12321232  }
    12331233
    1234   /// \ingroup topology
     1234  /// \ingroup graph_prop
    12351235  ///
    12361236  /// \brief Sort the nodes of a DAG into topolgical order.
     
    12841284  }
    12851285
    1286   /// \ingroup topology
     1286  /// \ingroup graph_prop
    12871287  ///
    12881288  /// \brief Check that the given directed graph is a DAG.
     
    13261326  }
    13271327
    1328   /// \ingroup topology
     1328  /// \ingroup graph_prop
    13291329  ///
    13301330  /// \brief Check that the given undirected graph is acyclic.
     
    13601360  }
    13611361
    1362   /// \ingroup topology
     1362  /// \ingroup graph_prop
    13631363  ///
    13641364  /// \brief Check that the given undirected graph is tree.
     
    14521452  }
    14531453
    1454   /// \ingroup topology
     1454  /// \ingroup graph_prop
    14551455  ///
    14561456  /// \brief Check if the given undirected graph is bipartite or not
     
    14911491  }
    14921492 
    1493   /// \ingroup topology
     1493  /// \ingroup graph_prop
    14941494  ///
    14951495  /// \brief Check if the given undirected graph is bipartite or not
Note: See TracChangeset for help on using the changeset viewer.