<commit_before>/*
 * Diameter.h
 *
 *  Created on: 19.02.2014
 *      Author: <NAME>, <NAME>
 */

#ifndef DIAMETER_H_
#define DIAMETER_H_

#include "../graph/Graph.h"

namespace NetworKit {

class Diameter {

public:

	/**
	 * TODO: documentation
	 */
	static std::pair<count, count> estimatedDiameterRange(const Graph& G, double error);

	/** @return exact diameter of the graph @a G */
	static count exactDiameter(const Graph& G);
};

} /* namespace NetworKit */

#endif /* DIAMETER_H_ */
<commit_msg>docstring Diameter<commit_after>/*
 * Diameter.h
 *
 *  Created on: 19.02.2014
 *      Author: <NAME>, <NAME>
 */

#ifndef DIAMETER_H_
#define DIAMETER_H_

#include "../graph/Graph.h"

namespace NetworKit {

class Diameter {

public:

	/**
	 * Estimates a range for the diameter of @a G. Based on the algorithm suggested in
	 * <NAME>, <NAME>, <NAME>: Fast Computation of Empirically Tight Bounds for
	 * the Diameter of Massive Graphs. Journal of Experimental Algorithmics, Volume 13, Feb 2009.
	 *
	 * @return Pair of lower and upper bound for diameter.
	 */
	static std::pair<count, count> estimatedDiameterRange(const Graph& G, double error);

	/** @return exact diameter of the graph @a G */
	static count exactDiameter(const Graph& G);
};

} /* namespace NetworKit */

#endif /* DIAMETER_H_ */

{'fraction_non_alphanumeric': 0.1289332310053722, 'fraction_numerical': 0.01688411358403684, 'mean_word_length': 3.607773851590106, 'pattern_counts': {'":': 0, '<': 12, '<?xml version=': 0, '>': 12, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5493185', 'n_tokens_mistral': 470, 'n_tokens_neox': 431, 'n_words': 138}