Ticket #392: bug.cpp

#include <lemon/list_graph.h>
#include <lemon/dfs.h>

using namespace lemon;
using namespace std;

typedef ListDigraph Graph;
typedef ListDigraph::Arc Arc;
typedef ListDigraph::Node Node;

//# creation of graphs
int main(){
  ListDigraph g;
  Node nodes[2];

  for(int i = 0; i < 2; ++i) 
    nodes[i] = g.addNode();

  g.addArc(nodes[0], nodes[1]);

  Dfs<Graph> d(g);
  bool ret = d.run(nodes[0], nodes[1]);

  if(ret)
    cout << "OK" << endl;
  else 
    cout << "not OK" << endl;

  if(d.reached(nodes[1]))
    cout << "OK" << endl;
  else 
    cout << "not OK" << endl;

  return 0;
}