# HG changeset patch
# User alpar
# Date 1081172905 0
# Node ID f0ff6981d4fdd7497442985bcf648f221c987f3e
# Parent  ae4911758833f7c02f2901a34795edbf403e693c
file doc added

diff -r ae4911758833 -r f0ff6981d4fd src/work/athos/suurballe.h
--- a/src/work/athos/suurballe.h	Mon Apr 05 13:48:01 2004 +0000
+++ b/src/work/athos/suurballe.h	Mon Apr 05 13:48:25 2004 +0000
@@ -2,6 +2,9 @@
 #ifndef HUGO_SUURBALLE_H
 #define HUGO_SUURBALLE_H
 
+///\file
+///\brief Suurballe algorithm.
+
 #include <iostream>
 #include <dijkstra.h>
 #include <graph_wrapper.h>
@@ -17,7 +20,6 @@
 /// 
 /// 
 
-
   template <typename Graph, typename T, 
     typename LengthMap=typename Graph::EdgeMap<T> >
   class Suurballe {
@@ -80,6 +82,8 @@
       length(_length), reversed(_G), dijkstra_dist(_G){ }
 
     ///Runs Suurballe's algorithm
+    
+    ///Runs Suurballe's algorithm
     ///Returns true iff there are k edge-disjoint paths from s to t
     bool run(Node s, Node t, int k) {