1.1 --- a/src/work/athos/suurballe.h	Mon Apr 05 13:48:01 2004 +0000
     1.2 +++ b/src/work/athos/suurballe.h	Mon Apr 05 13:48:25 2004 +0000
     1.3 @@ -2,6 +2,9 @@
     1.4  #ifndef HUGO_SUURBALLE_H
     1.5  #define HUGO_SUURBALLE_H
     1.6  
     1.7 +///\file
     1.8 +///\brief Suurballe algorithm.
     1.9 +
    1.10  #include <iostream>
    1.11  #include <dijkstra.h>
    1.12  #include <graph_wrapper.h>
    1.13 @@ -17,7 +20,6 @@
    1.14  /// 
    1.15  /// 
    1.16  
    1.17 -
    1.18    template <typename Graph, typename T, 
    1.19      typename LengthMap=typename Graph::EdgeMap<T> >
    1.20    class Suurballe {
    1.21 @@ -80,6 +82,8 @@
    1.22        length(_length), reversed(_G), dijkstra_dist(_G){ }
    1.23  
    1.24      ///Runs Suurballe's algorithm
    1.25 +    
    1.26 +    ///Runs Suurballe's algorithm
    1.27      ///Returns true iff there are k edge-disjoint paths from s to t
    1.28      bool run(Node s, Node t, int k) {
    1.29