1.1 --- a/test/connectivity_test.cc	Mon Jul 16 16:21:40 2018 +0200
     1.2 +++ b/test/connectivity_test.cc	Wed Oct 17 19:14:07 2018 +0200
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2010
     1.8 + * Copyright (C) 2003-2013
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -68,7 +68,7 @@
    1.13      Digraph::NodeMap<int> order(d);
    1.14      Graph g(d);
    1.15      Digraph::Node n = d.addNode();
    1.16 -    ignore_unused_variable_warning(n);
    1.17 +    ::lemon::ignore_unused_variable_warning(n);
    1.18  
    1.19      check(stronglyConnected(d), "This digraph is strongly connected");
    1.20      check(countStronglyConnectedComponents(d) == 1,
    1.21 @@ -99,6 +99,23 @@
    1.22    }
    1.23  
    1.24    {
    1.25 +    ListGraph g;
    1.26 +    ListGraph::NodeMap<bool> map(g);
    1.27 +
    1.28 +    ListGraph::Node n1 = g.addNode();
    1.29 +    ListGraph::Node n2 = g.addNode();
    1.30 +
    1.31 +    ListGraph::Edge e1 = g.addEdge(n1, n2);
    1.32 +    ::lemon::ignore_unused_variable_warning(e1);
    1.33 +    check(biNodeConnected(g), "Graph is bi-node-connected");
    1.34 +
    1.35 +    ListGraph::Node n3 = g.addNode();
    1.36 +    ::lemon::ignore_unused_variable_warning(n3);
    1.37 +    check(!biNodeConnected(g), "Graph is not bi-node-connected");
    1.38 +  }
    1.39 +
    1.40 +
    1.41 +  {
    1.42      Digraph d;
    1.43      Digraph::NodeMap<int> order(d);
    1.44      Graph g(d);
    1.45 @@ -246,7 +263,7 @@
    1.46      Digraph::Node shoe = d.addNode();
    1.47      Digraph::Node watch = d.addNode();
    1.48      Digraph::Node pants = d.addNode();
    1.49 -    ignore_unused_variable_warning(watch);
    1.50 +    ::lemon::ignore_unused_variable_warning(watch);
    1.51  
    1.52      d.addArc(socks, shoe);
    1.53      d.addArc(pants, shoe);