density.cc File Reference

#include <boost/graph/adjacency_list.hpp>
#include "density.h"

Functions
void	calculate_win_wout (const bidirected_t::graph &g, const std::set< bidirected_t::vertex > &s, bidirected_t::edge_name_t *win, bidirected_t::edge_name_t *wout)
	Calculates win and wout.

---

Detailed Description

---

Function Documentation

void calculate_win_wout	(	const bidirected_t::graph &	g,
		const std::set< bidirected_t::vertex > &	s,
		bidirected_t::edge_name_t *	win,
		bidirected_t::edge_name_t *	wout
	)

Calculates win and wout.

Calculates the weights of all edges contained within set s (saved in win) and those edges that split between a vertex in the set and a vertex elsewhere (saved in wout).

Parameters:

g	A full network
s	a set of vertices that are to be taken as a 'cluster'
win	a pointer to a lui that will be used to represent the weight of the inside edges
wout	a pointer to a lui that will be used to represent the weight of the outside edges.

Calculates the weights of all edges contained within set s (saved in win) and those edges that split between a vertex in the set and a vertex elsewhere (saved in wout).