-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathfindArticulationPoints.hpp
55 lines (43 loc) · 2.09 KB
/
findArticulationPoints.hpp
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
/*****************************************************************************
* * * * * CARNAC: Clustering coefficient-based Acquisition of RNA Communities
* * * * *
* * * * * Authors: Camille Marchet
* * * * * Contact: [email protected], INRIA/IRISA/GenScale, Campus de Beaulieu, 35042 Rennes Cedex, France
* * * * * Source: https://github.com/Kamimrcht/CARNAC
* * * * *
* * * * *
* * * * * This program is free software: you can redistribute it and/or modify
* * * * * it under the terms of the GNU Affero General Public License as
* * * * * published by the Free Software Foundation, either version 3 of the
* * * * * License, or (at your option) any later version.
* * * * *
* * * * * This program is distributed in the hope that it will be useful,
* * * * * but WITHOUT ANY WARRANTY; without even the implied warranty of
* * * * * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* * * * * GNU Affero General Public License for more details.
* * * * *
* * * * * You should have received a copy of the GNU Affero General Public License
* * * * * along with this program. If not, see <http://www.gnu.org/licenses/>.
* * * * * *****************************************************************************/
#include<iostream>
#include <list>
#ifndef PREPROC
#define PREPROC
using namespace std;
// A class that represents an undirected graph of reads
class Graph
{
public:
uint nbNodes;
vector<int> *edges;
//~ void APUtil(uint v, bool visited[], uint disc[], uint low[], uint parent[], bool ap[]);
void APUtil(int v, bool visited[], int disc[], int low[], int parent[], vector<bool>& ap);
bool APUtilBool(int v, bool visited[], int disc[], int low[], int parent[], vector<bool>& ap, set<uint>& interC);
Graph(uint nbNodes); // Constructor
~Graph();
void addEdge(int v, int w); // function to add an edge to graph
//~ void AP(bool* ap); // get articulation points
void AP(vector<bool>& ap); // get articulation points
bool APBool(vector<bool>& ap, set<uint>& interC); // get articulation points
};
#endif