Algorithms for computing graph spanners. More...
Classes | |
class | ogdf::SpannerBasicGreedy< TWeight > |
Multiplicative spanner by greedily adding edges. More... | |
class | ogdf::SpannerBaswanaSen< TWeight > |
Randomized multiplicative spanner calculation by forming clusters. More... | |
class | ogdf::SpannerBaswanaSenIterated< TWeight > |
Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerBaswanaSen algorithm up to 1000 times. More... | |
class | ogdf::SpannerBerman< TWeight > |
Approximation algorithm for calculating spanners. More... | |
class | ogdf::SpannerBermanDisconnected< TWeight > |
Wrapper around SpannerBerman: For each component of the graph, the algorithm will be called. More... | |
class | ogdf::SpannerElkinNeiman< TWeight > |
Randomized multiplicative spanner calculation by propagating random messages through the graph. More... | |
class | ogdf::SpannerElkinNeimanIterated< TWeight > |
Use the ogdf::SpannerIteratedWrapper to execute the ogdf::SpannerElkinNeiman algorithm up to 200 times. More... | |
class | ogdf::SpannerIteratedWrapper< TWeight > |
A implementation-independed wrapper class to execute a spanner algorithm multiple times. More... | |
class | ogdf::SpannerKortsarzPeleg< TWeight > |
Approximation multiplicative 2-spanner calculation. More... | |
class | ogdf::SpannerModule< TWeight > |
Interface for spanner algorithms. More... | |
Algorithms for computing graph spanners.