Changeset 1630:f67737f5727a in lemon-0.x
- Timestamp:
- 08/16/05 18:44:57 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2138
- Files:
-
- 4 edited
-
demo/graph_to_eps_demo.cc (modified) (1 diff)
-
lemon/concept/graph.h (modified) (3 diffs)
-
lemon/concept/undir_graph.h (modified) (5 diffs)
-
lemon/utility.h (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
demo/graph_to_eps_demo.cc
r1587 r1630 25 25 /// how to handle parallel egdes, how to change the properties (like 26 26 /// color, shape, size, title etc.) of nodes and edges individually 27 /// using appropriate \ref maps-page "graph mapfactory".27 /// using appropriate \ref maps-page "graph maps". 28 28 29 29 #include <cmath> -
lemon/concept/graph.h
r1627 r1630 428 428 Node source(Edge) const { return INVALID; } 429 429 430 /// Gives back the first Node in the iterating order.431 432 /// Gives back the first Node in the iterating order.433 ///430 // /// Gives back the first Node in the iterating order. 431 432 // /// Gives back the first Node in the iterating order. 433 // /// 434 434 void first(Node&) const {} 435 435 436 /// Gives back the next Node in the iterating order.437 438 /// Gives back the next Node in the iterating order.439 ///436 // /// Gives back the next Node in the iterating order. 437 438 // /// Gives back the next Node in the iterating order. 439 // /// 440 440 void next(Node&) const {} 441 441 442 /// Gives back the first Edge in the iterating order.443 444 /// Gives back the first Edge in the iterating order.445 ///442 // /// Gives back the first Edge in the iterating order. 443 444 // /// Gives back the first Edge in the iterating order. 445 // /// 446 446 void first(Edge&) const {} 447 /// Gives back the next Edge in the iterating order.448 449 /// Gives back the next Edge in the iterating order.450 ///447 // /// Gives back the next Edge in the iterating order. 448 449 // /// Gives back the next Edge in the iterating order. 450 // /// 451 451 void next(Edge&) const {} 452 452 453 453 454 /// Gives back the first of the Edges point to the given Node.455 456 /// Gives back the first of the Edges point to the given Node.457 ///454 // /// Gives back the first of the Edges point to the given Node. 455 456 // /// Gives back the first of the Edges point to the given Node. 457 // /// 458 458 void firstIn(Edge&, const Node&) const {} 459 459 460 /// Gives back the next of the Edges points to the given Node.461 462 463 /// Gives back the next of the Edges points to the given Node.464 ///460 // /// Gives back the next of the Edges points to the given Node. 461 462 463 // /// Gives back the next of the Edges points to the given Node. 464 // /// 465 465 void nextIn(Edge&) const {} 466 466 467 /// Gives back the first of the Edges start from the given Node.468 469 /// Gives back the first of the Edges start from the given Node.470 ///467 // /// Gives back the first of the Edges start from the given Node. 468 469 // /// Gives back the first of the Edges start from the given Node. 470 // /// 471 471 void firstOut(Edge&, const Node&) const {} 472 472 473 /// Gives back the next of the Edges start from the given Node.474 475 /// Gives back the next of the Edges start from the given Node.476 ///473 // /// Gives back the next of the Edges start from the given Node. 474 475 // /// Gives back the next of the Edges start from the given Node. 476 // /// 477 477 void nextOut(Edge&) const {} 478 478 … … 512 512 /// \warning Making maps that can handle bool type (NodeMap<bool>) 513 513 /// needs some extra attention! 514 /// \todo Wrong documentation 514 515 template<class T> 515 516 class NodeMap : public ReadWriteMap< Node, T > … … 535 536 /// \warning Making maps that can handle bool type (EdgeMap<bool>) 536 537 /// needs some extra attention! 538 /// \todo Wrong documentation 537 539 template<class T> 538 540 class EdgeMap : public ReadWriteMap<Edge,T> -
lemon/concept/undir_graph.h
r1627 r1630 33 33 namespace concept { 34 34 35 /// Skeleton class which describes an edge with direction in \ref36 /// UndirGraph "undirected graph".35 // /// Skeleton class which describes an edge with direction in \ref 36 // /// UndirGraph "undirected graph". 37 37 template <typename UndirGraph> 38 38 class UndirGraphEdge : public UndirGraph::UndirEdge { … … 675 675 /// \warning Making maps that can handle bool type (NodeMap<bool>) 676 676 /// needs some extra attention! 677 /// \todo Wrong documentation 677 678 template<class T> 678 679 class NodeMap : public ReadWriteMap< Node, T > … … 698 699 /// \warning Making maps that can handle bool type (EdgeMap<bool>) 699 700 /// needs some extra attention! 701 /// \todo Wrong documentation 700 702 template<class T> 701 703 class EdgeMap : public ReadWriteMap<Edge,T> … … 720 722 /// \warning Making maps that can handle bool type (UndirEdgeMap<bool>) 721 723 /// needs some extra attention! 724 /// \todo Wrong documentation 722 725 template<class T> 723 726 class UndirEdgeMap : public ReadWriteMap<UndirEdge,T> … … 791 794 Node target(Edge) const { return INVALID; } 792 795 793 /// \brief First node of the graph794 ///795 /// \note This method is part of so called \ref796 /// developpers_interface "Developpers' interface", so it shouldn't797 /// be used in an end-user program.796 // /// \brief First node of the graph 797 // /// 798 // /// \note This method is part of so called \ref 799 // /// developpers_interface "Developpers' interface", so it shouldn't 800 // /// be used in an end-user program. 798 801 void first(Node&) const {} 799 /// \brief Next node of the graph800 ///801 /// \note This method is part of so called \ref802 /// developpers_interface "Developpers' interface", so it shouldn't803 /// be used in an end-user program.802 // /// \brief Next node of the graph 803 // /// 804 // /// \note This method is part of so called \ref 805 // /// developpers_interface "Developpers' interface", so it shouldn't 806 // /// be used in an end-user program. 804 807 void next(Node&) const {} 805 808 806 /// \brief First undirected edge of the graph807 ///808 /// \note This method is part of so called \ref809 /// developpers_interface "Developpers' interface", so it shouldn't810 /// be used in an end-user program.809 // /// \brief First undirected edge of the graph 810 // /// 811 // /// \note This method is part of so called \ref 812 // /// developpers_interface "Developpers' interface", so it shouldn't 813 // /// be used in an end-user program. 811 814 void first(UndirEdge&) const {} 812 /// \brief Next undirected edge of the graph813 ///814 /// \note This method is part of so called \ref815 /// developpers_interface "Developpers' interface", so it shouldn't816 /// be used in an end-user program.815 // /// \brief Next undirected edge of the graph 816 // /// 817 // /// \note This method is part of so called \ref 818 // /// developpers_interface "Developpers' interface", so it shouldn't 819 // /// be used in an end-user program. 817 820 void next(UndirEdge&) const {} 818 821 819 /// \brief First directed edge of the graph820 ///821 /// \note This method is part of so called \ref822 /// developpers_interface "Developpers' interface", so it shouldn't823 /// be used in an end-user program.822 // /// \brief First directed edge of the graph 823 // /// 824 // /// \note This method is part of so called \ref 825 // /// developpers_interface "Developpers' interface", so it shouldn't 826 // /// be used in an end-user program. 824 827 void first(Edge&) const {} 825 /// \brief Next directed edge of the graph826 ///827 /// \note This method is part of so called \ref828 /// developpers_interface "Developpers' interface", so it shouldn't829 /// be used in an end-user program.828 // /// \brief Next directed edge of the graph 829 // /// 830 // /// \note This method is part of so called \ref 831 // /// developpers_interface "Developpers' interface", so it shouldn't 832 // /// be used in an end-user program. 830 833 void next(Edge&) const {} 831 834 832 /// \brief First outgoing edge from a given node833 ///834 /// \note This method is part of so called \ref835 /// developpers_interface "Developpers' interface", so it shouldn't836 /// be used in an end-user program.835 // /// \brief First outgoing edge from a given node 836 // /// 837 // /// \note This method is part of so called \ref 838 // /// developpers_interface "Developpers' interface", so it shouldn't 839 // /// be used in an end-user program. 837 840 void firstOut(Edge&, Node) const {} 838 /// \brief Next outgoing edge to a node839 ///840 /// \note This method is part of so called \ref841 /// developpers_interface "Developpers' interface", so it shouldn't842 /// be used in an end-user program.841 // /// \brief Next outgoing edge to a node 842 // /// 843 // /// \note This method is part of so called \ref 844 // /// developpers_interface "Developpers' interface", so it shouldn't 845 // /// be used in an end-user program. 843 846 void nextOut(Edge&) const {} 844 847 845 /// \brief First incoming edge to a given node846 ///847 /// \note This method is part of so called \ref848 /// developpers_interface "Developpers' interface", so it shouldn't849 /// be used in an end-user program.848 // /// \brief First incoming edge to a given node 849 // /// 850 // /// \note This method is part of so called \ref 851 // /// developpers_interface "Developpers' interface", so it shouldn't 852 // /// be used in an end-user program. 850 853 void firstIn(Edge&, Node) const {} 851 /// \brief Next incoming edge to a node852 ///853 /// \note This method is part of so called \ref854 /// developpers_interface "Developpers' interface", so it shouldn't855 /// be used in an end-user program.854 // /// \brief Next incoming edge to a node 855 // /// 856 // /// \note This method is part of so called \ref 857 // /// developpers_interface "Developpers' interface", so it shouldn't 858 // /// be used in an end-user program. 856 859 void nextIn(Edge&) const {} 857 860 -
lemon/utility.h
r1447 r1630 44 44 { 45 45 46 /// Basic type for defining "tags". A "YES" condition for enable_if.46 /// Basic type for defining "tags". A "YES" condition for \c enable_if. 47 47 48 /// Basic type for defining "tags". A "YES" condition for \c enable_if. 49 /// 50 ///\sa False 51 /// 48 52 /// \todo This should go to a separate "basic_types.h" (or something) 49 53 /// file. 50 54 struct True { 55 ///\e 51 56 static const bool value = true; 52 57 }; 53 58 54 /// Basic type for defining "tags". A "NO" condition for enable_if. 59 /// Basic type for defining "tags". A "NO" condition for \c enable_if. 60 61 /// Basic type for defining "tags". A "NO" condition for \c enable_if. 62 /// 63 ///\sa True 55 64 struct False { 65 ///\e 56 66 static const bool value = false; 57 67 };
Note: See TracChangeset
for help on using the changeset viewer.
