Changeset - r921:140c953ad5d1
« 917:4980b0
922:9312d6 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Minor doc improvements
0 5 0
default
5 files changed with 8 insertions and 7 deletions:
lemon/capacity_scaling.h
2
1
lemon/cost_scaling.h
2
1
lemon/cycle_canceling.h
2
1
lemon/kruskal.h
3
lemon/network_simplex.h
2
1
↑ Collapse diff ↑
lemon/capacity_scaling.h
Ignore white space 8 line context
... ... 
@@ -85,9 +85,10 @@
85 85 
  /// "CapacityScalingDefaultTraits<GR, V, C>".
86 86 
  /// In most cases, this parameter should not be set directly,
87 87 
  /// consider to use the named template parameters instead.
88 88 
  ///
89 
  /// \warning Both number types must be signed and all input data must
89 
  /// \warning Both \c V and \c C must be signed number types.
90 
  /// \warning All input data (capacities, supply values, and costs) must
90 91 
  /// be integer.
91 92 
  /// \warning This algorithm does not support negative costs for such
92 93 
  /// arcs that have infinite upper bound.
93 94 
#ifdef DOXYGEN
lemon/cost_scaling.h
Ignore white space 6 line context
... ... 
@@ -112,9 +112,10 @@
112 112 
  /// "CostScalingDefaultTraits<GR, V, C>".
113 113 
  /// In most cases, this parameter should not be set directly,
114 114 
  /// consider to use the named template parameters instead.
115 115 
  ///
116 
  /// \warning Both number types must be signed and all input data must
116 
  /// \warning Both \c V and \c C must be signed number types.
117 
  /// \warning All input data (capacities, supply values, and costs) must
117 118 
  /// be integer.
118 119 
  /// \warning This algorithm does not support negative costs for such
119 120 
  /// arcs that have infinite upper bound.
120 121 
  ///
lemon/cycle_canceling.h
Ignore white space 6 line context
... ... 
@@ -64,9 +64,10 @@
64 64 
  /// and supply values in the algorithm. By default, it is \c int.
65 65 
  /// \tparam C The number type used for costs and potentials in the
66 66 
  /// algorithm. By default, it is the same as \c V.
67 67 
  ///
68 
  /// \warning Both number types must be signed and all input data must
68 
  /// \warning Both \c V and \c C must be signed number types.
69 
  /// \warning All input data (capacities, supply values, and costs) must
69 70 
  /// be integer.
70 71 
  /// \warning This algorithm does not support negative costs for such
71 72 
  /// arcs that have infinite upper bound.
72 73 
  ///
lemon/kruskal.h
Ignore white space 6 line context
... ... 
@@ -29,11 +29,8 @@
29 29 

			




	30
	30
	
		
///\ingroup spantree


			




	31
	31
	
		
///\file


			




	32
	32
	
		
///\brief Kruskal's algorithm to compute a minimum cost spanning tree


			




	33
	
	
		
///


			




	34
	
	
		
///Kruskal's algorithm to compute a minimum cost spanning tree.


			




	35
	
	
		
///


			




	36
	33
	
		

			




	37
	34
	
		
namespace lemon {


			




	38
	35
	
		

			




	39
	36
	
		
  namespace _kruskal_bits {

			




        

    

    

    

        

            

                

                    lemon/network_simplex.h
                

                

                  
                  
                  
                  Ignore white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -62,9 +62,10 @@


			




	62
	62
	
		
  /// and supply values in the algorithm. By default, it is \c int.


			




	63
	63
	
		
  /// \tparam C The number type used for costs and potentials in the


			




	64
	64
	
		
  /// algorithm. By default, it is the same as \c V.


			




	65
	65
	
		
  ///


			




	66
	
	
		
  /// \warning Both number types must be signed and all input data must


			




	
	66
	
		
  /// \warning Both \c V and \c C must be signed number types.


			




	
	67
	
		
  /// \warning All input data (capacities, supply values, and costs) must


			




	67
	68
	
		
  /// be integer.


			




	68
	69
	
		
  ///


			




	69
	70
	
		
  /// \note %NetworkSimplex provides five different pivot rule


			




	70
	71
	
		
  /// implementations, from which the most efficient one is used


			




        

    






    
    



    


    

     
    
0 comments (0 inline)