| Revision: | 27 |
| Committed: | Thu Jul 5 15:26:40 2007 UTC (17 years, 10 months ago) by foucault |
| Content type: | text/plain |
| Original Path: | magic/lib/outil/outil/src/HypergraphLib_dfs.h |
| File size: | 357 byte(s) |
| Log Message: |
| # | User | Rev | Content |
|---|---|---|---|
| 1 | foucault | 27 | #ifndef DFS_H |
| 2 | #define DFS_H | ||
| 3 | |||
| 4 | #include <set> | ||
| 5 | |||
| 6 | namespace HypergraphLib { | ||
| 7 | |||
| 8 | class Graph; | ||
| 9 | class Node; | ||
| 10 | |||
| 11 | /** | ||
| 12 | * Depth First Search Algorithm : | ||
| 13 | * given one start node, find all nodes that are connected to it | ||
| 14 | * and return them | ||
| 15 | */ | ||
| 16 | void HYPERGRAPHLIB_ITEM dfs(Node *__n, std::set < Node * > & __depthFirstSearchNodes); | ||
| 17 | } | ||
| 18 | |||
| 19 | #endif// DFS_H |