All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
MissingLinksFinder.h
Go to the documentation of this file.
1 /*
2  * MissingLinksFinder.h
3  *
4  * Created on: 20.03.2015
5  * Author: Kolja Esders (kolja.esders@student.kit.edu)
6  */
7 
8 #ifndef MISSINGLINKSFINDER_H_
9 #define MISSINGLINKSFINDER_H_
10 
11 #include "../graph/Graph.h"
12 
13 #include <utility>
14 
15 namespace NetworKit {
16 
27 private:
28  const Graph& G;
29 
30 public:
35  explicit MissingLinksFinder(const Graph& G);
36 
45  std::vector<std::pair<node, node>> findAtDistance(count k);
46 
56  std::vector<std::pair<node, node>> findFromNode(node u, count k);
57 
58 };
59 
60 } // namespace NetworKit
61 
62 #endif /* MISSINGLINKSFINDER_H_ */
uint64_t count
Definition: Globals.h:21
index node
Definition: Globals.h:23
A graph (with optional weights) and parallel iterator methods.
Definition: Graph.h:79