sparse_graph.cc File Reference

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

#include "system/global_defs.h"
#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 &fcall)
	Output a sparse graph. More...

Detailed Description

Construction and partitioning of a sparse graph.

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

Please make a following refer to Flow123d on your project site if you use the program for any purpose, especially for academic research: Flow123d, Research Centre: Advanced Remedial Technologies, Technical University of Liberec, Czech Republic

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.

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, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 021110-1307, USA.

$Id$ $Revision$ $LastChangedBy$ $LastChangedDate$

Definition in file sparse_graph.cc.

Function Documentation

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

Edge comparison. For lexical sorting of local edges.

Definition at line 102 of file sparse_graph.cc.

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

Output a sparse graph.

Returns

Changed ostream.

Definition at line 321 of file sparse_graph.cc.