test/connectivity_test.cc
changeset 1089 552e3d1242c6
parent 1083 3e711ee55d31
child 1091 9eac00ea588f
equal deleted inserted replaced
4:7d011918e99b 6:99b2bbaed939
    95     check(bipartite(g), "This graph is bipartite.");
    95     check(bipartite(g), "This graph is bipartite.");
    96     check(loopFree(g), "This graph is loop-free.");
    96     check(loopFree(g), "This graph is loop-free.");
    97     check(parallelFree(g), "This graph is parallel-free.");
    97     check(parallelFree(g), "This graph is parallel-free.");
    98     check(simpleGraph(g), "This graph is simple.");
    98     check(simpleGraph(g), "This graph is simple.");
    99   }
    99   }
       
   100 
       
   101   {
       
   102     ListGraph g;
       
   103     ListGraph::NodeMap<bool> map(g);
       
   104 
       
   105     ListGraph::Node n1 = g.addNode();
       
   106     ListGraph::Node n2 = g.addNode();
       
   107 
       
   108     ListGraph::Edge e1 = g.addEdge(n1, n2);
       
   109     ::lemon::ignore_unused_variable_warning(e1);
       
   110     check(biNodeConnected(g), "Graph is bi-node-connected");
       
   111 
       
   112     ListGraph::Node n3 = g.addNode();
       
   113     ::lemon::ignore_unused_variable_warning(n3);
       
   114     check(!biNodeConnected(g), "Graph is not bi-node-connected");
       
   115   }
       
   116 
   100 
   117 
   101   {
   118   {
   102     Digraph d;
   119     Digraph d;
   103     Digraph::NodeMap<int> order(d);
   120     Digraph::NodeMap<int> order(d);
   104     Graph g(d);
   121     Graph g(d);