My Project
Public Member Functions
complex_density< graph_t > Class Template Reference

Weights simple_density measure with edge probability. More...

#include <density.h>

Inheritance diagram for complex_density< graph_t >:
density< graph_t >

List of all members.

Public Member Functions

 complex_density (double _lambda)
double operator() (typename graph_t::edge_name_t win, typename graph_t::edge_name_t wout, lui k) const

Detailed Description

template<typename graph_t>
class complex_density< graph_t >

Weights simple_density measure with edge probability.

Weighted equation of the simple definition and a ratio of the weights of included edges to the number of possible inside edges.


Constructor & Destructor Documentation

template<typename graph_t>
complex_density< graph_t >::complex_density ( double  _lambda) [inline]

Constructor

Parameters:
_lambdaParameter to control the focus balance between simple_density measure and edge probability (0 - 0.5 work best)

Member Function Documentation

template<typename graph_t>
double complex_density< graph_t >::operator() ( typename graph_t::edge_name_t  win,
typename graph_t::edge_name_t  wout,
lui  k 
) const [inline, virtual]

Calculates a density based on the above numbers.

Parameters:
winSum of weights of edges with both endpoints in cluster
woutSum of weights of edges with exactly one endpoint in cluster
kSize of the cluster
Returns:
(1-lambda)*simple_density + lambda*edge probability

Implements density< graph_t >.


The documentation for this class was generated from the following file:
 All Classes Files Functions Variables Typedefs