Changeset 313:64f8f7cc6168 in lemon1.2 for lemon/core.h
 Timestamp:
 10/09/08 10:09:44 (12 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/core.h
r300 r313 1555 1555 ///structure is updated after each graph alteration. Thus although 1556 1556 ///this data structure is theoretically faster than \ref ArcLookUp 1557 ///and \ref AllArcLook up, it often provides worse performance than1557 ///and \ref AllArcLookUp, it often provides worse performance than 1558 1558 ///them. 1559 1559 Arc operator()(Node s, Node t, Arc p = INVALID) const { … … 1700 1700 ///Find an arc between two nodes. 1701 1701 1702 ///Find an arc between two nodes in time <em>O</em>(log<em>d</em>), where1703 /// <em>d</em> is the number of outgoing arcs of \c s.1702 ///Find an arc between two nodes in time <em>O</em>(log<em>d</em>), 1703 ///where <em>d</em> is the number of outgoing arcs of \c s. 1704 1704 ///\param s The source node. 1705 1705 ///\param t The target node. … … 1818 1818 ///\endcode 1819 1819 /// 1820 ///Finding the first arc take <em>O</em>(log<em>d</em>) time, where1821 /// <em>d</em> is the number of outgoing arcs of \c s. Then,the1820 ///Finding the first arc take <em>O</em>(log<em>d</em>) time, 1821 ///where <em>d</em> is the number of outgoing arcs of \c s. Then the 1822 1822 ///consecutive arcs are found in constant time. 1823 1823 ///
Note: See TracChangeset
for help on using the changeset viewer.