sparse_graph.cc File Reference

Construction and partitioning of a sparse graph. More...

#include "system/asserts.hh"
#include "system/system.hh"
#include "la/distribution.hh"
#include "sparse_graph.hh"
#include "boost/lambda/lambda.hpp"
#include <algorithm>
#include <metis.h>

Go to the source code of this file.

Functions
bool	operator< (const SparseGraph::Edge &a, const SparseGraph::Edge &b)
ostream &	operator<< (ostream &out, const SparseGraph &)
	Output a sparse graph. More...

Detailed Description

Construction and partitioning of a sparse graph.

 * Copyright (C) 2015 Technical University of Liberec. All rights reserved.

This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 3 as published by the Free Software Foundation. (http://www.gnu.org/licenses/gpl-3.0.en.html)

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.

Definition in file sparse_graph.cc.

Function Documentation

operator<()

bool operator<	(	const SparseGraph::Edge &	a,
		const SparseGraph::Edge &	b
	)

Edge comparison. For lexical sorting of local edges.

Definition at line 89 of file sparse_graph.cc.

operator<<()

ostream& operator<<	(	ostream &	out,
		const SparseGraph &	sg
	)

Output a sparse graph.

Returns

Changed ostream.

Definition at line 313 of file sparse_graph.cc.