Tulip  5.1.0
Large graphs analysis and drawing
Bfs.h
1 /*
2  *
3  * This file is part of Tulip (http://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 
22 #ifndef Bfs_H
23 #define Bfs_H
24 
25 #include <tulip/MutableContainer.h>
26 #include <tulip/Node.h>
27 
28 namespace tlp {
29 class Graph;
30 class BooleanProperty;
31 class TLP_SCOPE Bfs {
32 public :
33 
34  Bfs(Graph * G, BooleanProperty* resultatAlgoSelection);
35  ~Bfs();
36 
37  Graph *graph;
38 
39 private :
40 
41  void computeBfs(Graph * G, BooleanProperty* resultatAlgoSelection, node root);
42 
43  unsigned int nbNodes;
44  MutableContainer<bool> selectedNodes;
45  MutableContainer<bool> selectedEdges;
46 
47 };
48 }
49 #endif
50 ///@endcond