density.h File Reference

Holds definitions of different cluster density measures. More...

#include "graph.h"

Go to the source code of this file.

Classes
class	density< graph_t >
	Interface for densities. More...
class	simple_density< graph_t >
	Ratio of internal weights to internal+external weights. More...
class	complex_density< graph_t >
	Weights simple_density measure with edge probability. More...
class	negative_density< graph_t >
	For use in networks with negative edge weights. More...
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

Holds definitions of different cluster density measures.

---

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).