/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

 @ingroup algs

 @ingroup algs

 \brief Algorithms for finding shortest paths.

 \brief Algorithms for finding shortest paths.

 This group contains the algorithms for finding shortest paths in digraphs.

 This group contains the algorithms for finding shortest paths in digraphs.

    source node when all arc lengths are non-negative.

    source node when all arc lengths are non-negative.

  - \ref Suurballe A successive shortest path algorithm for finding

  - \ref Suurballe A successive shortest path algorithm for finding

    arc-disjoint paths between two nodes having minimum total length.

    arc-disjoint paths between two nodes having minimum total length.

 */

 */

 \ref Preflow implements the preflow push-relabel algorithm of Goldberg and

 \ref Preflow implements the preflow push-relabel algorithm of Goldberg and

 Tarjan for solving this problem. It also provides functions to query the

 Tarjan for solving this problem. It also provides functions to query the

 minimum cut, which is the dual problem of maximum flow.

 minimum cut, which is the dual problem of maximum flow.

 for finding feasible circulations, which is a somewhat different problem,

 for finding feasible circulations, which is a somewhat different problem,

 but it is strongly related to maximum flow.

 but it is strongly related to maximum flow.

 For more information, see \ref Circulation.

 For more information, see \ref Circulation.

 */

 */