RhodeCode

     node("s",s).

     node("x",x).

     node("y",y).

     node("z",z).

     run();

   MaxCardinalitySearch<Digraph,CapMap> maxcard(g,cap);

   maxcard.init();

   maxcard.addSource(s);

   maxcard.start(x);

         !maxcard.processed(y), "Wrong processed()!");

   a=maxcard.nextNode();

   check(maxcard.processNextNode()==a,

         "Wrong nextNode() or processNextNode() return value!");

   check(maxcard.processed(a), "Wrong processNextNode()!");

   maxcard.start();

         "Wrong cardinalities!");

 }

 void checkWithConst1Map(std::istringstream &input) {

   typedef SmartDigraph Digraph;

   typedef Digraph::Node Node;

   Digraph g;

   Node s,x,y,z;

  DigraphReader<Digraph>(g,input).

    node("s",s).