/usr/include/tulip/SimpleTest.h is in libtulip-dev 3.1.2-2.3ubuntu3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 | //-*-c++-*-
/**
Authors: David Auber, Patrick Mary, Morgan Mathiaut
from the LaBRI Visualization Team
Email : auber@tulip-software.org
Last modification : 13/03/2009
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
*/
/*
* Authors: J��y Compostella, Jean Darracq, Benjamin Muller,
* Fabrice Rochambeau, Fabiani Simplice, Jyl Cristoff Zobeide
*
* Email : jcompost@etu.u-bordeaux1.fr, jdarracq@etu.u-bordeaux1.fr,
* bmuller@etu.u-bordeaux1.fr, frochamb@etu.u-bordeaux1.fr,
* fsimplic@etu.u-bordeaux1.fr, jczobeid@etu.u-bordeaux1.fr.
*
*$Id $
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*/
#ifndef TULIP_SIMPLETEST_H
#define TULIP_SIMPLETEST_H
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#if (__GNUC__ < 3)
#include <hash_set>
#else
#include <ext/hash_set>
#endif
#include "tulip/ObservableGraph.h"
namespace tlp {
class Graph;
/** \addtogroup graph_test */
/*@{*/
/**
* class for testing if the graph is simple (ie no self loops and no multiple or parallel edges)
*/
class TLP_SCOPE SimpleTest : public GraphObserver {
public:
static bool isSimple(Graph *graph);
static void makeSimple(Graph* graph, std::vector<edge> &removed);
static bool simpleTest(Graph *graph, std::vector<edge> *multipleEdges=0, std::vector<edge> *loops=0);
private:
SimpleTest();
void addEdge(Graph *, const edge);
void delEdge(Graph *, const edge);
void destroy(Graph *);
void deleteResult(Graph *graph);
static SimpleTest *instance;
stdext::hash_map<unsigned long, bool> resultsBuffer;
};
/*@}*/
}
#endif
|