/* -*- 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 checkStaticDigraph() {

 void checkStaticDigraph() {

   SmartDigraph g;

   SmartDigraph g;

   SmartDigraph::NodeMap<StaticDigraph::Node> nref(g);

   SmartDigraph::NodeMap<StaticDigraph::Node> nref(g);

   SmartDigraph::ArcMap<StaticDigraph::Arc> aref(g);

   SmartDigraph::ArcMap<StaticDigraph::Arc> aref(g);

   StaticDigraph G;

   StaticDigraph G;

   checkGraphNodeList(G, 0);

   checkGraphNodeList(G, 0);

   checkGraphArcList(G, 0);

   checkGraphArcList(G, 0);

   G.build(g, nref, aref);

   G.build(g, nref, aref);

   arcs.push_back(std::make_pair(4,2));

   arcs.push_back(std::make_pair(4,2));

   arcs.push_back(std::make_pair(4,3));

   arcs.push_back(std::make_pair(4,3));

   arcs.push_back(std::make_pair(4,1));

   arcs.push_back(std::make_pair(4,1));

   G.build(6, arcs.begin(), arcs.end());

   G.build(6, arcs.begin(), arcs.end());

   checkGraphNodeList(G, 6);

   checkGraphNodeList(G, 6);

   checkGraphArcList(G, 9);

   checkGraphArcList(G, 9);

   checkGraphOutArcList(G, G.node(0), 2);

   checkGraphOutArcList(G, G.node(0), 2);

   checkGraphOutArcList(G, G.node(1), 2);

   checkGraphOutArcList(G, G.node(1), 2);

   checkNodeIds(G);

   checkNodeIds(G);

   checkArcIds(G);

   checkArcIds(G);

   checkGraphNodeMap(G);

   checkGraphNodeMap(G);

   checkGraphArcMap(G);

   checkGraphArcMap(G);

   int n = G.nodeNum();

   int n = G.nodeNum();

   int m = G.arcNum();

   int m = G.arcNum();

   check(G.index(G.node(n-1)) == n-1, "Wrong index.");

   check(G.index(G.node(n-1)) == n-1, "Wrong index.");

   check(G.index(G.arc(m-1)) == m-1, "Wrong index.");

   check(G.index(G.arc(m-1)) == m-1, "Wrong index.");

 }

 }