Changeset 1946:17eb3eaad9f8 in lemon-0.x for lemon/concept
- Timestamp:
- 02/02/06 18:43:24 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2521
- Location:
- lemon/concept
- Files:
-
- 3 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/concept/bpugraph.h
r1933 r1946 245 245 /// Its usage is quite simple, for example you can count the number 246 246 /// of nodes in graph \c g of type \c Graph like this: 247 /// 247 ///\code 248 248 /// int count=0; 249 249 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count; 250 /// 250 ///\endcode 251 251 class NodeIt : public Node { 252 252 public: … … 290 290 /// Its usage is quite simple, for example you can count the number 291 291 /// of nodes in graph \c g of type \c Graph like this: 292 /// 292 ///\code 293 293 /// int count=0; 294 294 /// for (Graph::ANodeIt n(g); n!=INVALID; ++n) ++count; 295 /// 295 ///\endcode 296 296 class ANodeIt : public ANode { 297 297 public: … … 335 335 /// Its usage is quite simple, for example you can count the number 336 336 /// of nodes in graph \c g of type \c Graph like this: 337 /// 337 ///\code 338 338 /// int count=0; 339 339 /// for (Graph::BNodeIt n(g); n!=INVALID; ++n) ++count; 340 /// 340 ///\endcode 341 341 class BNodeIt : public BNode { 342 342 public: … … 426 426 /// Its usage is quite simple, for example you can count the number 427 427 /// of undirected edges in a graph \c g of type \c Graph as follows: 428 /// 428 ///\code 429 429 /// int count=0; 430 430 /// for(Graph::UEdgeIt e(g); e!=INVALID; ++e) ++count; 431 /// 431 ///\endcode 432 432 class UEdgeIt : public UEdge { 433 433 public: … … 474 474 /// of incident edges of a node \c n 475 475 /// in graph \c g of type \c Graph as follows. 476 /// 476 ///\code 477 477 /// int count=0; 478 478 /// for(Graph::IncEdgeIt e(g, n); e!=INVALID; ++e) ++count; 479 /// 479 ///\endcode 480 480 class IncEdgeIt : public UEdge { 481 481 public: … … 563 563 /// Its usage is quite simple, for example you can count the number 564 564 /// of edges in a graph \c g of type \c Graph as follows: 565 /// 565 ///\code 566 566 /// int count=0; 567 567 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count; 568 /// 568 ///\endcode 569 569 class EdgeIt : public Edge { 570 570 public: … … 608 608 /// of outgoing edges of a node \c n 609 609 /// in graph \c g of type \c Graph as follows. 610 /// 610 ///\code 611 611 /// int count=0; 612 612 /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count; 613 /// 613 ///\endcode 614 614 615 615 class OutEdgeIt : public Edge { … … 660 660 /// of outgoing edges of a node \c n 661 661 /// in graph \c g of type \c Graph as follows. 662 /// 662 ///\code 663 663 /// int count=0; 664 664 /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count; 665 /// 665 ///\endcode 666 666 667 667 class InEdgeIt : public Edge { -
lemon/concept/graph.h
r1909 r1946 193 193 /// Its usage is quite simple, for example you can count the number 194 194 /// of nodes in graph \c g of type \c Graph like this: 195 /// 195 ///\code 196 196 /// int count=0; 197 197 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count; 198 /// 198 ///\endcode 199 199 class NodeIt : public Node { 200 200 public: … … 286 286 /// of outgoing edges of a node \c n 287 287 /// in graph \c g of type \c Graph as follows. 288 /// 288 ///\code 289 289 /// int count=0; 290 290 /// for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count; 291 /// 291 ///\endcode 292 292 293 293 class OutEdgeIt : public Edge { … … 333 333 /// of outgoing edges of a node \c n 334 334 /// in graph \c g of type \c Graph as follows. 335 /// 335 ///\code 336 336 /// int count=0; 337 337 /// for(Graph::InEdgeIt e(g, n); e!=INVALID; ++e) ++count; 338 /// 338 ///\endcode 339 339 340 340 class InEdgeIt : public Edge { … … 377 377 /// Its usage is quite simple, for example you can count the number 378 378 /// of edges in a graph \c g of type \c Graph as follows: 379 /// 379 ///\code 380 380 /// int count=0; 381 381 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count; 382 /// 382 ///\endcode 383 383 class EdgeIt : public Edge { 384 384 public: -
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.