/usr/include/tulip/AcyclicTest.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 69 70 71 | //-*-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.
*/
#ifndef TULIP_TEST_H
#define TULIP_TEST_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"
#include <list>
#include <tulip/MutableContainer.h>
namespace tlp {
class Graph;
class BooleanProperty;
class SelfLoops {
public:
SelfLoops(node n1,node n2,edge e1, edge e2,edge e3,edge old):
n1(n1),n2(n2),e1(e1),e2(e2),e3(e3),old(old){
}
node n1,n2;
edge e1,e2,e3,old;
};
/** \addtogroup graph_test */
/*@{*/
/// Class for testing if the graph is acyclic
class TLP_SCOPE AcyclicTest : public GraphObserver {
public:
/** returns true if the graph is acyclic, false if not.
* The result is cached (ie. the next call with the same graph is done in O(1) time)
*/
static bool isAcyclic(const Graph *graph);
static void makeAcyclic(Graph* graph, std::vector<edge> &reversed, std::vector<tlp::SelfLoops> &selfLoops);
static bool acyclicTest(const Graph *, std::vector<edge> *obstructionEdges = 0);
private:
static bool dfsAcyclicTest(const Graph *graph, const node n,
MutableContainer<bool> &visited,
MutableContainer<bool> &finished,
std::vector<edge> *obstructionEdges = 0);
void addEdge(Graph *,const edge);
void delEdge(Graph *,const edge);
void reverseEdge(Graph *,const edge);
void destroy(Graph *);
AcyclicTest();
static AcyclicTest * instance;
stdext::hash_map<unsigned int,bool> resultsBuffer;
};
}
/*@}*/
#endif
|