File containing macros and functions to test properties on graphs. More...
#include <test/test.h>
#include <util/forall.h>
#include <util/unorderedset.h>
Go to the source code of this file.
Namespaces | |
namespace | test |
Namespace containing test facilities. | |
Defines | |
#define | CHECK_NEIGHBORS_BIGRAPH(G) TEST_RESULT &= test::check_neighborsBiGraph(G, __LINE__) |
Check if the neighbors of the vertices of G are in G, if they are not twice in the neighborhood and if a vertex is not a neighor of itself. | |
#define | CHECK_NEIGHBORS_GRAPH(G) TEST_RESULT &= test::check_neighborsGraph(G, __LINE__) |
Check if the neighbors of the vertices of G are in G, if they are not twice in the neighborhood and if a vertex is not a neighor of itself. | |
#define | CHECK_SYMMETRIC_BIGRAPH(G) TEST_RESULT &= test::check_symmetricBiGraph(G, __LINE__) |
#define | CHECK_SYMMETRIC_GRAPH(G) TEST_RESULT &= test::check_symmetricGraph(G, __LINE__) |
Check if the graph G is symmetric and update result accordingly. | |
Functions | |
template<typename BiGraph > | |
bool | test::check_neighborsBiGraph (const BiGraph &G, size_t line_nb) |
template<typename Graph > | |
bool | test::check_neighborsGraph (const Graph &G, size_t line_nb) |
template<typename BiGraph > | |
bool | test::check_symmetricBiGraph (const BiGraph &G, size_t line_nb) |
template<typename Graph > | |
bool | test::check_symmetricGraph (const Graph &G, size_t line_nb) |
template<typename VertexContent > | |
QString | test::toStr (const graph::Vertex< VertexContent > &v) |
File containing macros and functions to test properties on graphs.
Definition in file graph.vvh.
#define CHECK_NEIGHBORS_BIGRAPH | ( | G | ) | TEST_RESULT &= test::check_neighborsBiGraph(G, __LINE__) |
#define CHECK_NEIGHBORS_GRAPH | ( | G | ) | TEST_RESULT &= test::check_neighborsGraph(G, __LINE__) |
#define CHECK_SYMMETRIC_GRAPH | ( | G | ) | TEST_RESULT &= test::check_symmetricGraph(G, __LINE__) |
Check if the graph G is symmetric and update result
accordingly.