COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/connectivity_test.cc

    r1268 r1259  
    9898    check(simpleGraph(g), "This graph is simple.");
    9999  }
    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 
    117100
    118101  {
Note: See TracChangeset for help on using the changeset viewer.