| 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_dfs.h |
| 15 |
//####// |
| 16 |
//####//------------------------------------------------------------ |
| 17 |
//####//------------------------------------------------------------ |
| 18 |
//####// COPYRIGHT 2000-2024 |
| 19 |
//####// jeu 13 jun 2024 11:54:00 EDT |
| 20 |
//####//------------------------------------------------------------ |
| 21 |
//####//------------------------------------------------------------ |
| 22 |
#ifndef DFS_H |
| 23 |
#define DFS_H |
| 24 |
|
| 25 |
#include <set> |
| 26 |
|
| 27 |
namespace HypergraphLib { |
| 28 |
|
| 29 |
class Graph; |
| 30 |
class Node; |
| 31 |
|
| 32 |
/** |
| 33 |
* Depth First Search Algorithm : |
| 34 |
* given one start node, find all nodes that are connected to it |
| 35 |
* and return them |
| 36 |
*/ |
| 37 |
void HYPERGRAPHLIB_ITEM dfs(Node *__n, std::set < Node * > & __depthFirstSearchNodes); |
| 38 |
} |
| 39 |
|
| 40 |
#endif// DFS_H |
