Allows the user to find missing links in the given graph. More...
#include <MissingLinksFinder.h>
Public Member Functions  
MissingLinksFinder (const Graph &G)  
std::vector< std::pair< node, node > >  findAtDistance (count k) 
Returns all missing links in the graph that have distance k. More...  
std::vector< std::pair< node, node > >  findFromNode (node u, count k) 
Returns all missing links in the graph that have distance k and are connected to u. More...  
Allows the user to find missing links in the given graph.
The absent links to find are narrowed down by providing a distance that the nodes of the missing links should have. For example in case of distance 2 only nodepairs that would close a triangle in the given graph get returned.

explicit 
G  The graph to find missing links in 
Returns all missing links in the graph that have distance k.
Note that a distance of k actually means that there are k different links on the path of the two nodes that are connected through that path.
k  Distance of the absent links 
std::vector< std::pair< node, node > > NetworKit::MissingLinksFinder::findFromNode  (  node  u, 
count  k  
) 
Returns all missing links in the graph that have distance k and are connected to u.
Note that a distance of k actually means that there are k different links on the path of the two nodes that are connected through that path.
u  Node to find missing links from 
k  Distance of the absent links 