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

   {

   {

     Digraph d;

     Digraph d;

     Graph g(d);

     Graph g(d);

     Digraph::Node n = d.addNode();

     Digraph::Node n = d.addNode();

     ::lemon::ignore_unused_variable_warning(n);

     ::lemon::ignore_unused_variable_warning(n);

     checkDiEulerIt(d);

     checkDiEulerIt(d);

     checkDiEulerIt(g);

     checkDiEulerIt(g);

     checkEulerIt(g);

     checkEulerIt(g);

     check(eulerian(d), "This graph is Eulerian");

     check(eulerian(d), "This graph is Eulerian");