/usr/include/tulip/BiconnectedTest.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 | //-*-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_BICONNEX_H
#define TULIP_BICONNEX_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 biconnected
class TLP_SCOPE BiconnectedTest : public GraphObserver {
public:
/**
* Returns true if the graph is biconnected (ie. one must remove at least two nodes in order
* to disconnect the graph), false if not.
*/
static bool isBiconnected(Graph *graph);
/**
* If the graph is not biconnected, add edges in order to make the graph
* biconnected. The new edges are added in addedEdges.
*/
static void makeBiconnected(Graph *graph, std::vector<edge>& addedEdges);
private:
void connect(Graph *, std::vector<edge>& addedEdges);
bool compute(Graph *);
void addEdge(Graph *,const edge);
void delEdge(Graph *,const edge);
void reverseEdge(Graph *,const edge);
void addNode(Graph *,const node);
void delNode(Graph *,const node);
void destroy(Graph *);
BiconnectedTest(); //to ensure singleton
static BiconnectedTest * instance;
stdext::hash_map<unsigned long,bool> resultsBuffer;
};
}
/*@}*/
#endif
|