SpannerElkinNeiman.h File Reference

Implementation of the random k-spanner algorithm of Elkin and Neiman 2018. More...

#include <ogdf/basic/Queue.h>
#include <ogdf/basic/simple_graph_alg.h>
#include <ogdf/graphalg/SpannerIteratedWrapper.h>
#include <ogdf/graphalg/SpannerModule.h>

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
namespace	ogdf
	The namespace for all OGDF objects.

Detailed Description

Implementation of the random k-spanner algorithm of Elkin and Neiman 2018.

Author

Finn Stutzenstein

License:

This file is part of the Open Graph Drawing Framework (OGDF).

Copyright (C)
See README.md in the OGDF root directory for details.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file SpannerElkinNeiman.h.