SNAP Library , Developer Reference
2013-01-07 14:03:36
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
|
Go to the source code of this file.
Classes | |
class | TNetConstraint< PGraph > |
Namespaces | |
namespace | TSnap |
Main namespace for all the Snap global entities. | |
Functions | |
template<class PGraph > | |
double | TSnap::GetClustCf (const PGraph &Graph, int SampleNodes=-1) |
Computes the average clustering coefficient as defined in Watts and Strogatz, Collective dynamics of 'small-world' networks. | |
template<class PGraph > | |
double | TSnap::GetClustCf (const PGraph &Graph, TFltPrV &DegToCCfV, int SampleNodes=-1) |
template<class PGraph > | |
double | TSnap::GetClustCf (const PGraph &Graph, TFltPrV &DegToCCfV, int &ClosedTriads, int &OpenTriads, int SampleNodes=-1) |
template<class PGraph > | |
double | TSnap::GetNodeClustCf (const PGraph &Graph, const int &NId) |
Returns clustering coefficient of a particular node. | |
template<class PGraph > | |
void | TSnap::GetNodeClustCf (const PGraph &Graph, TIntFltH &NIdCCfH) |
Computes clustering coefficient of each node of the Graph. | |
template<class PGraph > | |
int | TSnap::GetTriads (const PGraph &Graph, int SampleNodes=-1) |
template<class PGraph > | |
int | TSnap::GetTriads (const PGraph &Graph, int &ClosedTriads, int &OpenTriads, int SampleNodes=-1) |
template<class PGraph > | |
void | TSnap::GetTriads (const PGraph &Graph, TIntTrV &NIdCOTriadV, int SampleNodes=-1) |
template<class PGraph > | |
int | TSnap::GetTriadEdges (const PGraph &Graph, int SampleEdges=-1) |
template<class PGraph > | |
int | TSnap::GetNodeTriads (const PGraph &Graph, const int &NId) |
Returns number of undirected triads a node NId participates in. | |
template<class PGraph > | |
int | TSnap::GetNodeTriads (const PGraph &Graph, const int &NId, int &ClosedTriads, int &OpenTriads) |
Returns number of undirected Open and Closed triads a node NId participates in. | |
template<class PGraph > | |
int | TSnap::GetNodeTriads (const PUNGraph &Graph, const int &NId, const TIntSet &GroupSet, int &InGroupEdges, int &InOutGroupEdges) |
template<class PGraph > | |
int | TSnap::GetNodeTriads (const PUNGraph &Graph, const int &NId, const TIntSet &GroupSet, int &InGroupEdges, int &InOutGroupEdges, int &OutGroup) |
template<class PGraph > | |
void | TSnap::GetTriadParticip (const PGraph &Graph, TIntPrV &TriadCntV) |
Triangle Participation Ratio: For each node counts how many triangles it participates in and then returns a set of pairs (number of triangles, number of such nodes). | |
template<class PGraph > | |
int | TSnap::GetCmnNbrs (const PGraph &Graph, const int &NId1, const int &NId2) |
Returns a number of shared neighbors between a pair of nodes NId1 and NId2. | |
template<class PGraph > | |
int | TSnap::GetCmnNbrs (const PGraph &Graph, const int &NId1, const int &NId2, TIntV &NbrV) |
Returns the shared neighbors between a pair of nodes NId1 and NId2. | |
template<class PGraph > | |
int | TSnap::GetLen2Paths (const PGraph &Graph, const int &NId1, const int &NId2) |
Returns the number of length 2 directed paths between a pair of nodes NId1, NId2 (NId1 --> U --> NId2). | |
template<class PGraph > | |
int | TSnap::GetLen2Paths (const PGraph &Graph, const int &NId1, const int &NId2, TIntV &NbrV) |
Returns the 2 directed paths between a pair of nodes NId1, NId2 (NId1 --> U --> NId2). NbrV intermediary stores nodes U. | |
template<class PGraph > | |
int | TSnap::GetNodeTriads (const PGraph &Graph, const int &NId, const TIntSet &GroupSet, int &InGroupEdges, int &InOutGroupEdges) |
template<class PGraph > | |
int | TSnap::GetNodeTriads (const PGraph &Graph, const int &NId, const TIntSet &GroupSet, int &InGroupEdges, int &InOutGroupEdges, int &OutGroupEdges) |
template<> | |
int | TSnap::GetCmnNbrs< PUNGraph > (const PUNGraph &Graph, const int &NId1, const int &NId2, TIntV &NbrV) |