Tulip 5.7.1
Large graphs analysis and drawing
Loading...
Searching...
No Matches
Bfs.h
1/*
2 *
3 * This file is part of Tulip (https://tulip.labri.fr)
4 *
5 * Authors: David Auber and the Tulip development Team
6 * from LaBRI, University of Bordeaux
7 *
8 * Tulip is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU Lesser General Public License
10 * as published by the Free Software Foundation, either version 3
11 * of the License, or (at your option) any later version.
12 *
13 * Tulip is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
16 * See the GNU General Public License for more details.
17 *
18 */
19///@cond DOXYGEN_HIDDEN
20
21#ifndef Bfs_H
22#define Bfs_H
23
24#include <tulip/MutableContainer.h>
25#include <tulip/Node.h>
26
27namespace tlp {
28class Graph;
29class BooleanProperty;
30class TLP_SCOPE Bfs {
31public:
32 Bfs(Graph *G, BooleanProperty *resultatAlgoSelection);
33 ~Bfs();
34
35 Graph *graph;
36
37private:
38 void computeBfs(Graph *G, BooleanProperty *resultatAlgoSelection, node root);
39
40 unsigned int nbNodes;
41 MutableContainer<bool> selectedNodes;
42 MutableContainer<bool> selectedEdges;
43};
44} // namespace tlp
45#endif
46///@endcond