Changeset 1526:8c14aa8f27a2 in lemon0.x for lemon/graph_utils.h
 Timestamp:
 06/30/05 18:13:30 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2012
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/graph_utils.h
r1515 r1526 74 74 /// This function counts the nodes in the graph. 75 75 /// The complexity of the function is O(n) but for some 76 /// graph structure it is specialized to run in O(1).76 /// graph structures it is specialized to run in O(1). 77 77 /// 78 78 /// \todo refer how to specialize it … … 101 101 /// This function counts the edges in the graph. 102 102 /// The complexity of the function is O(e) but for some 103 /// graph structure it is specialized to run in O(1).103 /// graph structures it is specialized to run in O(1). 104 104 105 105 template <typename Graph> … … 122 122 } 123 123 124 /// \brief Function to count the edges in the graph.125 /// 126 /// This function counts the edges in the graph.124 /// \brief Function to count the undirected edges in the graph. 125 /// 126 /// This function counts the undirected edges in the graph. 127 127 /// The complexity of the function is O(e) but for some 128 128 /// graph structure it is specialized to run in O(1). … … 175 175 } 176 176 177 /// \e178 179 /// \todo Please document.180 /// 177 /// \brief Function to count the number of the outedges from node \c n. 178 /// 179 /// This function counts the number of the outedges from node \c n 180 /// in the graph. 181 181 template <typename Graph> 182 182 inline int countOutEdges(const Graph& _g, const typename Graph::Node& _n) { … … 184 184 } 185 185 186 /// \e187 188 /// \todo Please document.189 /// 186 /// \brief Function to count the number of the inedges to node \c n. 187 /// 188 /// This function counts the number of the inedges to node \c n 189 /// in the graph. 190 190 template <typename Graph> 191 191 inline int countInEdges(const Graph& _g, const typename Graph::Node& _n) { … … 365 365 /// Provides an immutable and unique id for each item in the graph. 366 366 367 /// The IdMap class provides a nunique and immutable mapping for each item367 /// The IdMap class provides a unique and immutable mapping for each item 368 368 /// in the graph. 369 369 /// … … 430 430 431 431 432 /// \brief General inver sable graphmap type.433 434 /// This type provides simple inver sable map functions.435 /// The Inver sableMap wraps an arbitrary ReadWriteMap436 /// and if a key is set tedto a new value then store it432 /// \brief General invertable graphmap type. 433 434 /// This type provides simple invertable map functions. 435 /// The InvertableMap wraps an arbitrary ReadWriteMap 436 /// and if a key is set to a new value then store it 437 437 /// in the inverse map. 438 438 /// \param _Graph The graph type. 439 /// \param _Map The map to extend with inver sable functionality.439 /// \param _Map The map to extend with invertable functionality. 440 440 template < 441 441 typename _Graph,
Note: See TracChangeset
for help on using the changeset viewer.