Added the function isFinite(), and replaced the calls to finite() with it.
This was necessary because finite() is not a standard function. Neither can
we use its standard counterpart isfinite(), because it was introduced only
in C99, and therefore it is not supplied by all C++ implementations.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2007
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #ifndef LEMON_TEST_GRAPH_UTILS_TEST_H
20 #define LEMON_TEST_GRAPH_UTILS_TEST_H
23 #include "test_tools.h"
29 //! \brief Test cases for graph utils.
32 template <typename Graph>
33 void checkGraphCounters() {
36 addPetersen(graph, num);
38 check(countNodes(graph) == 2*num, "Wrong node number.");
39 check(countEdges(graph) == 6*num, "Wrong edge number.");
40 for (typename Graph::NodeIt it(graph); it != INVALID; ++it) {
41 check(countOutEdges(graph, it) == 3, "Wrong out degree number.");
42 check(countInEdges(graph, it) == 3, "Wrong in degree number.");
46 template <typename Graph>
47 void checkFindEdge() {
48 typedef typename Graph::Node Node;
49 typedef typename Graph::Edge Edge;
50 typedef typename Graph::NodeIt NodeIt;
51 typedef typename Graph::EdgeIt EdgeIt;
53 for (int i = 0; i < 10; ++i) {
56 DescriptorMap<Graph, Node> nodes(graph);
57 typename DescriptorMap<Graph, Node>::InverseMap invNodes(nodes);
58 for (int i = 0; i < 100; ++i) {
59 int src = rnd[invNodes.size()];
60 int trg = rnd[invNodes.size()];
61 graph.addEdge(invNodes[src], invNodes[trg]);
63 typename Graph::template EdgeMap<bool> found(graph, false);
64 DescriptorMap<Graph, Edge> edges(graph);
65 for (NodeIt src(graph); src != INVALID; ++src) {
66 for (NodeIt trg(graph); trg != INVALID; ++trg) {
67 for (ConEdgeIt<Graph> con(graph, src, trg); con != INVALID; ++con) {
68 check(graph.source(con) == src, "Wrong source.");
69 check(graph.target(con) == trg, "Wrong target.");
70 check(found[con] == false, "The edge found already.");
75 for (EdgeIt it(graph); it != INVALID; ++it) {
76 check(found[it] == true, "The edge is not found.");