Implementation of the random k-spanner algorithm of Elkin and Neiman 2018. More...
#include <ogdf/basic/EpsilonTest.h>
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/Math.h>
#include <ogdf/basic/Queue.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/simple_graph_alg.h>
#include <ogdf/graphalg/SpannerIteratedWrapper.h>
#include <ogdf/graphalg/SpannerModule.h>
#include <cmath>
#include <limits>
#include <string>
Go to the source code of this file.
Classes | |
class | ogdf::SpannerElkinNeiman< TWeight > |
Randomized multiplicative spanner calculation by propagating random messages through the graph. More... | |
struct | ogdf::SpannerElkinNeiman< TWeight >::BfsNode |
class | ogdf::SpannerElkinNeimanIterated< TWeight > |
Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerElkinNeiman algorithm up to 200 times. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
Implementation of the random k-spanner algorithm of Elkin and Neiman 2018.
Definition in file SpannerElkinNeiman.h.