1 |
//####//------------------------------------------------------------ |
2 |
//####//------------------------------------------------------------ |
3 |
//####// MAGiC |
4 |
//####// Jean Christophe Cuilliere et Vincent FRANCOIS |
5 |
//####// Departement de Genie Mecanique - UQTR |
6 |
//####//------------------------------------------------------------ |
7 |
//####// MAGIC est un projet de recherche de l equipe ERICCA |
8 |
//####// du departement de genie mecanique de l Universite du Quebec a Trois Rivieres |
9 |
//####// http://www.uqtr.ca/ericca |
10 |
//####// http://www.uqtr.ca/ |
11 |
//####//------------------------------------------------------------ |
12 |
//####//------------------------------------------------------------ |
13 |
//####// |
14 |
//####// hypergraphlib_findcycles.h |
15 |
//####// |
16 |
//####//------------------------------------------------------------ |
17 |
//####//------------------------------------------------------------ |
18 |
//####// COPYRIGHT 2000-2024 |
19 |
//####// jeu 13 jun 2024 11:54:00 EDT |
20 |
//####//------------------------------------------------------------ |
21 |
//####//------------------------------------------------------------ |
22 |
#ifndef FINDCYCLES_H |
23 |
#define FINDCYCLES_H |
24 |
|
25 |
|
26 |
#include <map> |
27 |
#include <vector> |
28 |
|
29 |
namespace HypergraphLib { |
30 |
|
31 |
|
32 |
class Graph; |
33 |
class Node; |
34 |
|
35 |
|
36 |
|
37 |
HYPERGRAPHLIB_ITEM void dfsCycle(Node *__n, std::vector < Node * > & __depthFirstSearchNodes, std::vector < std::vector < Node * > > & cycle); |
38 |
HYPERGRAPHLIB_ITEM void |
39 |
FindCycles(Graph * __G, std::vector < std::vector < Node * > > & cycles); |
40 |
} |
41 |
|
42 |
#endif//FINDCYCLES_H |