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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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 General Public License for more details.
*
*/
#ifndef _StrongComponent_H
#define _StrongComponent_H
#include <stack>
#include <tulip/tuliphash.h>
#include <tulip/TulipPlugin.h>
struct NodeInfo {
NodeInfo(int stra=0,int sta=0):prefixOrder(stra),minAttach(sta) {}
int prefixOrder;
int minAttach;
};
/** This plugin is an implementation of the Stongly connected algorithm.
*
* \note This algorithm assigns to each node a value defined as following : If two nodes are in the same
* strongly connected component they have the same value else they have a
* different value.
*
*/
class StrongComponent:public tlp::DoubleAlgorithm {
public:
StrongComponent(const tlp::PropertyContext &);
~StrongComponent();
bool run();
bool check(std::string &);
void reset();
private:
int attachNumerotation(tlp::node, TLP_HASH_MAP<tlp::node,bool> &,
TLP_HASH_MAP<tlp::node,bool> &,
TLP_HASH_MAP<tlp::node,int> &, int &,
std::stack<tlp::node> &, int &);
};
#endif
|
