Changeset 1946:17eb3eaad9f8 in lemon-0.x for lemon/concept/ugraph.h
- Timestamp:
- 02/02/06 18:43:24 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2521
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/ugraph.h
r1910 r1946 305 305 /// Its usage is quite simple, for example you can count the number 306 306 /// of nodes in graph \c g of type \c Graph like this: 307 /// 307 ///\code 308 308 /// int count=0; 309 309 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count; 310 /// 310 ///\endcode 311 311 class NodeIt : public Node { 312 312 public: … … 396 396 /// Its usage is quite simple, for example you can count the number 397 397 /// of undirected edges in a graph \c g of type \c Graph as follows: 398 /// 398 ///\code 399 399 /// int count=0; 400 400 /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count; 401 /// 401 ///\endcode 402 402 class UEdgeIt : public UEdge { 403 403 public: … … 444 444 /// of incident edges of a node \c n 445 445 /// in graph \c g of type \c Graph as follows. 446 /// 446 ///\code 447 447 /// int count=0; 448 448 /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count; 449 /// 449 ///\endcode 450 450 class IncEdgeIt : public UEdge { 451 451 public: … … 533 533 /// Its usage is quite simple, for example you can count the number 534 534 /// of edges in a graph \c g of type \c Graph as follows: 535 /// 535 ///\code 536 536 /// int count=0; 537 537 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count; 538 /// 538 ///\endcode 539 539 class EdgeIt : public Edge { 540 540 public: … … 578 578 /// of outgoing edges of a node \c n 579 579 /// in graph \c g of type \c Graph as follows. 580 /// 580 ///\code 581 581 /// int count=0; 582 582 /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count; 583 /// 583 ///\endcode 584 584 585 585 class OutEdgeIt : public Edge { … … 630 630 /// of outgoing edges of a node \c n 631 631 /// in graph \c g of type \c Graph as follows. 632 /// 632 ///\code 633 633 /// int count=0; 634 634 /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count; 635 /// 635 ///\endcode 636 636 637 637 class InEdgeIt : public Edge {
Note: See TracChangeset
for help on using the changeset viewer.