graph_utils.hh File Reference

Functions for reading graphs and getting graph properties. More...

#include <lemon/core.h>
#include <lemon/smart_graph.h>
#include <lemon/random.h>
#include <lemon/dim2.h>
#include <algorithm>
#include <iostream>

Include dependency graph for graph_utils.hh:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
	minlca
	Default namespace Default namespace for MinLCA algorithms.
	minlca::utils
	Namespace for util functions and classes.

Enumerations
enum	minlca::utils::GraphFormat { RMF, GRA }
	Available graph formats.

Functions
template<typename IS , typename Graph >
void	minlca::utils::readGraphRmfRandomOrder (Graph &g, int seed, IS &in)
	Read a graph in RMF format. More...
template<typename IS , typename Graph >
void	minlca::utils::readGraphGraRandomOrder (Graph &g, int seed, IS &in)
	Read a graph in GRA format. More...
template<typename IS = std::istream, typename Graph = lemon::SmartGraph>
void	minlca::utils::readGraphRandomOrder (Graph &g, int seed=0, GraphFormat f=RMF, IS &in=std::cin)
	Read a graph in random order. More...
template<typename IS = std::istream, typename Graph = lemon::SmartGraph>
void	minlca::utils::readGraph (Graph &g, GraphFormat f=RMF, IS &in=std::cin)
	Read a graph. More...
template<typename Graph >
int	minlca::utils::degree (const Graph &g, const typename Graph::Node &v)
	Degree of a vertex. More...
template<typename Graph >
int	minlca::utils::maxDegree (const Graph &g)
	Maximum degree of a graph. More...

Detailed Description

Functions for reading graphs and getting graph properties.

Definition in file graph_utils.hh.