/* -*- 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

 }

 }

 void initFlowTest()

 void initFlowTest()

 {

 {

   DIGRAPH_TYPEDEFS(SmartDigraph);

   DIGRAPH_TYPEDEFS(SmartDigraph);

   SmartDigraph g;

   SmartDigraph g;

   SmartDigraph::ArcMap<int> cap(g),iflow(g);

   SmartDigraph::ArcMap<int> cap(g),iflow(g);

   Node s=g.addNode(); Node t=g.addNode();

   Node s=g.addNode(); Node t=g.addNode();

   Node n1=g.addNode(); Node n2=g.addNode();

   Node n1=g.addNode(); Node n2=g.addNode();

   Arc a;

   Arc a;

   check(preflow_test.flowValue() == min_cut_value,

   check(preflow_test.flowValue() == min_cut_value,

         "The max flow value or the three min cut values are incorrect.");

         "The max flow value or the three min cut values are incorrect.");

   initFlowTest();

   initFlowTest();

   return 0;

   return 0;

 }

 }