Changeset - r772:f964a00b9068
« 771:8452ca
780:580af8 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Small fix in the doc (#179)
0 2 0
default
2 files changed with 2 insertions and 2 deletions:
lemon/hartmann_orlin.h
1
1
lemon/karp.h
1
1
↑ Collapse diff ↑
lemon/hartmann_orlin.h
Show white space 48 line context
... ... 
@@ -48,49 +48,49 @@
48 48 
  struct HartmannOrlinDefaultTraits
49 49 
  {
50 50 
    /// The type of the digraph
51 51 
    typedef GR Digraph;
52 52 
    /// The type of the length map
53 53 
    typedef LEN LengthMap;
54 54 
    /// The type of the arc lengths
55 55 
    typedef typename LengthMap::Value Value;
56 56 

			




	57
	57
	
		
    /// \brief The large value type used for internal computations


			




	58
	58
	
		
    ///


			




	59
	59
	
		
    /// The large value type used for internal computations.


			




	60
	60
	
		
    /// It is \c long \c long if the \c Value type is integer,


			




	61
	61
	
		
    /// otherwise it is \c double.


			




	62
	62
	
		
    /// \c Value must be convertible to \c LargeValue.


			




	63
	63
	
		
    typedef double LargeValue;


			




	64
	64
	
		

			




	65
	65
	
		
    /// The tolerance type used for internal computations


			




	66
	66
	
		
    typedef lemon::Tolerance<LargeValue> Tolerance;


			




	67
	67
	
		

			




	68
	68
	
		
    /// \brief The path type of the found cycles


			




	69
	69
	
		
    ///


			




	70
	70
	
		
    /// The path type of the found cycles.


			




	71
	71
	
		
    /// It must conform to the \ref lemon::concepts::Path "Path" concept


			




	72
	
	
		
    /// and it must have an \c addBack() function.


			




	
	72
	
		
    /// and it must have an \c addFront() function.


			




	73
	73
	
		
    typedef lemon::Path<Digraph> Path;


			




	74
	74
	
		
  };


			




	75
	75
	
		

			




	76
	76
	
		
  // Default traits class for integer value types


			




	77
	77
	
		
  template <typename GR, typename LEN>


			




	78
	78
	
		
  struct HartmannOrlinDefaultTraits<GR, LEN, true>


			




	79
	79
	
		
  {


			




	80
	80
	
		
    typedef GR Digraph;


			




	81
	81
	
		
    typedef LEN LengthMap;


			




	82
	82
	
		
    typedef typename LengthMap::Value Value;


			




	83
	83
	
		
#ifdef LEMON_HAVE_LONG_LONG


			




	84
	84
	
		
    typedef long long LargeValue;


			




	85
	85
	
		
#else


			




	86
	86
	
		
    typedef long LargeValue;


			




	87
	87
	
		
#endif


			




	88
	88
	
		
    typedef lemon::Tolerance<LargeValue> Tolerance;


			




	89
	89
	
		
    typedef lemon::Path<Digraph> Path;


			




	90
	90
	
		
  };


			




	91
	91
	
		

			




	92
	92
	
		

			




	93
	93
	
		
  /// \addtogroup min_mean_cycle


			




	94
	94
	
		
  /// @{


			




	95
	95
	
		

			




	96
	96
	
		
  /// \brief Implementation of the Hartmann-Orlin algorithm for finding

			




        

    

    

    

        

            

                

                    lemon/karp.h
                

                

                  
                  
                  
                  Show white space
                  48 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -48,49 +48,49 @@


			




	48
	48
	
		
  struct KarpDefaultTraits


			




	49
	49
	
		
  {


			




	50
	50
	
		
    /// The type of the digraph


			




	51
	51
	
		
    typedef GR Digraph;


			




	52
	52
	
		
    /// The type of the length map


			




	53
	53
	
		
    typedef LEN LengthMap;


			




	54
	54
	
		
    /// The type of the arc lengths


			




	55
	55
	
		
    typedef typename LengthMap::Value Value;


			




	56
	56
	
		

			




	57
	57
	
		
    /// \brief The large value type used for internal computations


			




	58
	58
	
		
    ///


			




	59
	59
	
		
    /// The large value type used for internal computations.


			




	60
	60
	
		
    /// It is \c long \c long if the \c Value type is integer,


			




	61
	61
	
		
    /// otherwise it is \c double.


			




	62
	62
	
		
    /// \c Value must be convertible to \c LargeValue.


			




	63
	63
	
		
    typedef double LargeValue;


			




	64
	64
	
		

			




	65
	65
	
		
    /// The tolerance type used for internal computations


			




	66
	66
	
		
    typedef lemon::Tolerance<LargeValue> Tolerance;


			




	67
	67
	
		

			




	68
	68
	
		
    /// \brief The path type of the found cycles


			




	69
	69
	
		
    ///


			




	70
	70
	
		
    /// The path type of the found cycles.


			




	71
	71
	
		
    /// It must conform to the \ref lemon::concepts::Path "Path" concept


			




	72
	
	
		
    /// and it must have an \c addBack() function.


			




	
	72
	
		
    /// and it must have an \c addFront() function.


			




	73
	73
	
		
    typedef lemon::Path<Digraph> Path;


			




	74
	74
	
		
  };


			




	75
	75
	
		

			




	76
	76
	
		
  // Default traits class for integer value types


			




	77
	77
	
		
  template <typename GR, typename LEN>


			




	78
	78
	
		
  struct KarpDefaultTraits<GR, LEN, true>


			




	79
	79
	
		
  {


			




	80
	80
	
		
    typedef GR Digraph;


			




	81
	81
	
		
    typedef LEN LengthMap;


			




	82
	82
	
		
    typedef typename LengthMap::Value Value;


			




	83
	83
	
		
#ifdef LEMON_HAVE_LONG_LONG


			




	84
	84
	
		
    typedef long long LargeValue;


			




	85
	85
	
		
#else


			




	86
	86
	
		
    typedef long LargeValue;


			




	87
	87
	
		
#endif


			




	88
	88
	
		
    typedef lemon::Tolerance<LargeValue> Tolerance;


			




	89
	89
	
		
    typedef lemon::Path<Digraph> Path;


			




	90
	90
	
		
  };


			




	91
	91
	
		

			




	92
	92
	
		

			




	93
	93
	
		
  /// \addtogroup min_mean_cycle


			




	94
	94
	
		
  /// @{


			




	95
	95
	
		

			




	96
	96
	
		
  /// \brief Implementation of Karp's algorithm for finding a minimum


			




        

    






    
    



    


    

     
    
0 comments (0 inline)