Changeset 1536:308150155bb5 in lemon-0.x for lemon
- Timestamp:
- 07/04/05 18:27:54 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2028
- Location:
- lemon
- Files:
-
- 8 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/bfs.h
r1516 r1536 85 85 86 86 ///This function instantiates a \ref ProcessedMap. 87 ///\param Gis the graph, to which87 ///\param g is the graph, to which 88 88 ///we would like to define the \ref ProcessedMap 89 #ifdef DOXYGEN 90 static ProcessedMap *createProcessedMap(const GR &g) 91 #else 89 92 static ProcessedMap *createProcessedMap(const GR &) 93 #endif 90 94 { 91 95 return new ProcessedMap(); … … 660 664 661 665 ///This function copies the shortest path to \c t into \c p. 662 ///If it \c \t is a source itself or unreachable, then it does not666 ///If \c t is a source itself or unreachable, then it does not 663 667 ///alter \c p. 664 668 ///\todo Is it the right way to handle unreachable nodes? … … 771 775 772 776 ///This function instantiates a \ref PredMap. 773 ///\param Gis the graph, to which we would like to define the PredMap.777 ///\param g is the graph, to which we would like to define the PredMap. 774 778 ///\todo The graph alone may be insufficient to initialize 779 #ifdef DOXYGEN 780 static PredMap *createPredMap(const GR &g) 781 #else 775 782 static PredMap *createPredMap(const GR &) 783 #endif 776 784 { 777 785 return new PredMap(); … … 804 812 805 813 ///This function instantiates a \ref ProcessedMap. 806 ///\param Gis the graph, to which814 ///\param g is the graph, to which 807 815 ///we would like to define the \ref ProcessedMap 816 #ifdef DOXYGEN 817 static ProcessedMap *createProcessedMap(const GR &g) 818 #else 808 819 static ProcessedMap *createProcessedMap(const GR &) 820 #endif 809 821 { 810 822 return new ProcessedMap(); … … 834 846 835 847 ///This function instantiates a \ref DistMap. 836 ///\param G is the graph, to which we would like to define the \ref DistMap 848 ///\param g is the graph, to which we would like to define the \ref DistMap 849 #ifdef DOXYGEN 850 static DistMap *createDistMap(const GR &g) 851 #else 837 852 static DistMap *createDistMap(const GR &) 853 #endif 838 854 { 839 855 return new DistMap(); -
lemon/dfs.h
r1529 r1536 85 85 86 86 ///This function instantiates a \ref ProcessedMap. 87 ///\param Gis the graph, to which87 ///\param g is the graph, to which 88 88 ///we would like to define the \ref ProcessedMap 89 #ifdef DOXYGEN 90 static ProcessedMap *createProcessedMap(const GR &g) 91 #else 89 92 static ProcessedMap *createProcessedMap(const GR &) 93 #endif 90 94 { 91 95 return new ProcessedMap(); … … 780 784 781 785 ///This function instantiates a \ref PredMap. 782 ///\param Gis the graph, to which we would like to define the PredMap.786 ///\param g is the graph, to which we would like to define the PredMap. 783 787 ///\todo The graph alone may be insufficient to initialize 788 #ifdef DOXYGEN 789 static PredMap *createPredMap(const GR &g) 790 #else 784 791 static PredMap *createPredMap(const GR &) 792 #endif 785 793 { 786 794 return new PredMap(); … … 813 821 814 822 ///This function instantiates a \ref ProcessedMap. 815 ///\param Gis the graph, to which823 ///\param g is the graph, to which 816 824 ///we would like to define the \ref ProcessedMap 825 #ifdef DOXYGEN 826 static ProcessedMap *createProcessedMap(const GR &g) 827 #else 817 828 static ProcessedMap *createProcessedMap(const GR &) 829 #endif 818 830 { 819 831 return new ProcessedMap(); … … 843 855 844 856 ///This function instantiates a \ref DistMap. 845 ///\param G is the graph, to which we would like to define the \ref DistMap 857 ///\param g is the graph, to which we would like to define the \ref DistMap 858 #ifdef DOXYGEN 859 static DistMap *createDistMap(const GR &g) 860 #else 846 861 static DistMap *createDistMap(const GR &) 862 #endif 847 863 { 848 864 return new DistMap(); -
lemon/dijkstra.h
r1516 r1536 109 109 110 110 ///This function instantiates a \ref ProcessedMap. 111 ///\param Gis the graph, to which111 ///\param g is the graph, to which 112 112 ///we would like to define the \ref ProcessedMap 113 #ifdef DOXYGEN 114 static ProcessedMap *createProcessedMap(const GR &g) 115 #else 113 116 static ProcessedMap *createProcessedMap(const GR &) 117 #endif 114 118 { 115 119 return new ProcessedMap(); … … 664 668 665 669 ///This function copies the shortest path to \c t into \c p. 666 ///If it \c \t is a source itself or unreachable, then it does not670 ///If it \c t is a source itself or unreachable, then it does not 667 671 ///alter \c p. 668 672 ///\todo Is it the right way to handle unreachable nodes? … … 789 793 790 794 ///This function instantiates a \ref PredMap. 791 ///\param Gis the graph, to which we would like to define the PredMap.795 ///\param g is the graph, to which we would like to define the PredMap. 792 796 ///\todo The graph alone may be insufficient for the initialization 797 #ifdef DOXYGEN 798 static PredMap *createPredMap(const GR &g) 799 #else 793 800 static PredMap *createPredMap(const GR &) 801 #endif 794 802 { 795 803 return new PredMap(); … … 807 815 808 816 ///This function instantiates a \ref ProcessedMap. 809 ///\param Gis the graph, to which817 ///\param g is the graph, to which 810 818 ///we would like to define the \ref ProcessedMap 819 #ifdef DOXYGEN 820 static ProcessedMap *createProcessedMap(const GR &g) 821 #else 811 822 static ProcessedMap *createProcessedMap(const GR &) 823 #endif 812 824 { 813 825 return new ProcessedMap(); … … 822 834 823 835 ///This function instantiates a \ref DistMap. 824 ///\param G is the graph, to which we would like to define the \ref DistMap 836 ///\param g is the graph, to which we would like to define the \ref DistMap 837 #ifdef DOXYGEN 838 static DistMap *createDistMap(const GR &g) 839 #else 825 840 static DistMap *createDistMap(const GR &) 841 #endif 826 842 { 827 843 return new DistMap(); -
lemon/error.h
r1435 r1536 101 101 protected: 102 102 ///\e 103 ///\todo The good solution is boost:shared_ptr... 103 104 ///\todo The good solution is boost::shared_ptr... 105 /// 104 106 mutable 105 107 std::auto_ptr<std::ostringstream> buf; -
lemon/graph_adaptor.h
r1472 r1536 452 452 of edge-disjoint paths between \c s and \c t in the graph which has edge-set 453 453 all the tight edges. The computation will be demonstrated on the following 454 graph, which is read from the dimacs file \ refsub_graph_adaptor_demo.dim.454 graph, which is read from the dimacs file \c sub_graph_adaptor_demo.dim. 455 455 The full source code is available in \ref sub_graph_adaptor_demo.cc. 456 456 If you are interested in more demo programs, you can use -
lemon/graph_utils.h
r1531 r1536 178 178 /// } 179 179 /// \endcode 180 /// \todo We may want to use the \ref concept::GraphBase"GraphBase"180 /// \todo We may want to use the "GraphBase" 181 181 /// interface here... 182 182 /// \bug Untested ... … … 860 860 /// 861 861 /// The subscript operator. 862 /// \param e dgeThe edge862 /// \param e The edge 863 863 /// \return The target of the edge 864 Value operator[](const Key& key) {865 return graph.target( key);864 Value operator[](const Key& e) { 865 return graph.target(e); 866 866 } 867 867 -
lemon/lp_base.h
r1508 r1536 400 400 401 401 ///\return 402 ///- -\ref INF: the constraint is lower unbounded.403 ///- -\ref NaN: lower bound has not been set.402 ///- \ref INF "INF": the constraint is lower unbounded. 403 ///- \ref NaN "NaN": lower bound has not been set. 404 404 ///- finite number: the lower bound 405 405 Value &lowerBound() { return _lb; } … … 409 409 410 410 ///\return 411 ///- -\ref INF: the constraint is upper unbounded.412 ///- -\ref NaN: upper bound has not been set.411 ///- \ref INF "INF": the constraint is upper unbounded. 412 ///- \ref NaN "NaN": upper bound has not been set. 413 413 ///- finite number: the upper bound 414 414 Value &upperBound() { return _ub; } -
lemon/maps.h
r1531 r1536 228 228 ///Its \c Value is inherited from \c M. 229 229 /// 230 ///Actually,231 ///\code232 /// ConvertMap<X> sh(x,v);233 ///\endcode234 ///it is equivalent with235 ///\code236 /// ConstMap<X::Key, X::Value> c_tmp(v);237 /// AddMap<X, ConstMap<X::Key, X::Value> > sh(x,v);238 ///\endcode239 230 ///\bug wrong documentation 240 231 template<class M, class T> … … 253 244 254 245 ///Constructor 255 ///\param _m is the undelying map 256 ///\param _v is the convert value 246 ///\param _m is the underlying map 257 247 ConvertMap(const M &_m) : m(_m) {}; 258 248 … … 260 250 /// 261 251 /// The subscript operator. 262 /// \param edge The edge252 /// \param k The key 263 253 /// \return The target of the edge 264 254 Value operator[](Key k) const {return m[k];} … … 298 288 299 289 ///Constructor 300 301 ///\e302 ///303 290 AddMap(const M1 &_m1,const M2 &_m2) : m1(_m1), m2(_m2) {}; 304 291 Value operator[](Key k) const {return m1[k]+m2[k];} … … 387 374 388 375 ///Constructor 389 390 ///\e391 ///392 376 SubMap(const M1 &_m1,const M2 &_m2) : m1(_m1), m2(_m2) {}; 393 377 Value operator[](Key k) const {return m1[k]-m2[k];} … … 427 411 428 412 ///Constructor 429 430 ///\e431 ///432 413 MulMap(const M1 &_m1,const M2 &_m2) : m1(_m1), m2(_m2) {}; 433 414 Value operator[](Key k) const {return m1[k]*m2[k];} … … 513 494 514 495 ///Constructor 515 516 ///\e517 ///518 496 DivMap(const M1 &_m1,const M2 &_m2) : m1(_m1), m2(_m2) {}; 519 497 Value operator[](Key k) const {return m1[k]/m2[k];} … … 561 539 562 540 ///Constructor 563 564 ///\e565 ///566 541 ComposeMap(const M1 &_m1,const M2 &_m2) : m1(_m1), m2(_m2) {}; 567 542 Value operator[](Key k) const {return m1[m2[k]];} … … 616 591 617 592 ///Constructor 618 619 ///\e620 ///621 593 CombineMap(const M1 &_m1,const M2 &_m2,const F &_f) 622 594 : m1(_m1), m2(_m2), f(_f) {}; … … 667 639 668 640 ///Constructor 669 670 ///\e671 ///672 641 NegMap(const M &_m) : m(_m) {}; 673 642 Value operator[](Key k) const {return -m[k];} … … 721 690 722 691 ///Constructor 723 724 ///\e725 ///726 692 AbsMap(const M &_m) : m(_m) {}; 727 693 Value operator[](Key k) const {Value tmp=m[k]; return tmp>=0?tmp:-tmp;} … … 764 730 765 731 ///Constructor 766 767 ///\e768 ///769 732 FunctorMap(const F &_f) : f(_f) {}; 770 733 Value operator[](Key k) const {return f(k);}
Note: See TracChangeset
for help on using the changeset viewer.
