SNAP Library 3.0, User Reference  2016-07-20 17:56:49
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
centr.cpp File Reference

Go to the source code of this file.

Namespaces

 TSnap
 Main namespace for all the Snap global entities.
 

Functions

double TSnap::GetDegreeCentr (const PUNGraph &Graph, const int &NId)
 
void TSnap::GetEigenVectorCentr (const PUNGraph &Graph, TIntFltH &NIdEigenH, const double &Eps, const int &MaxIter)
 
double TSnap::GetGroupDegreeCentr (const PUNGraph &Graph, const PUNGraph &Group)
 
double TSnap::GetGroupDegreeCentr0 (const PUNGraph &Graph, const TIntH &GroupNodes)
 
double TSnap::GetGroupDegreeCentr (const PUNGraph &Graph, const TIntH &GroupNodes)
 
double TSnap::GetGroupFarnessCentr (const PUNGraph &Graph, const TIntH &GroupNodes)
 
PUNGraphTSnap::AllGraphsWithNNodes (int n)
 
TIntHTSnap::AllCombinationsMN (int m, int n)
 
double TSnap::GetGroupClosenessCentr (const PUNGraph &Graph, const TIntH &GroupNodes)
 
TIntH TSnap::MaxCPGreedyBetter (const PUNGraph &Graph, const int k)
 Returns centrality Maximum k group. More...
 
TIntH TSnap::MaxCPGreedyBetter1 (const PUNGraph &Graph, const int k)
 Returns centrality Maximum k group. More...
 
TIntH TSnap::MaxCPGreedyBetter2 (const PUNGraph &Graph, const int k)
 Returns centrality Maximum k group. More...
 
TIntH TSnap::MaxCPGreedyBetter3 (const PUNGraph &Graph, const int k)
 Returns centrality Maximum k group. More...
 
int TSnap::GetWeightedPageRank (const PNEANet Graph, TIntFltH &PRankH, const TStr &Attr, const double &C=0.85, const double &Eps=1e-4, const int &MaxIter=100)
 Weighted PageRank (TODO: Use template) More...
 
int TSnap::GetWeightedPageRankMP (const PNEANet Graph, TIntFltH &PRankH, const TStr &Attr, const double &C, const double &Eps, const int &MaxIter)
 
TIntFltH TSnap::EventImportance (const PNGraph &Graph, const int k)
 Event importance. More...
 
TIntFltH TSnap::EventImportance1 (const PNGraph &Graph, const int k)
 
int TSnap::Intersect (TUNGraph::TNodeI Node, TIntH NNodes)
 Intersect. More...
 
int TSnap::Intersect (TUNGraph::TNodeI Node, TStr NNodes)
 Intersect. More...
 
int TSnap::Intersect (TUNGraph::TNodeI Node, int *NNodes, int NNodes_br)
 Intersect. More...
 
int TSnap::Intersect1 (TUNGraph::TNodeI Node, TStr NNodes)
 
TIntH TSnap::LoadNodeList (TStr InFNmNodes)
 
int TSnap::findMinimum (TIntV &Frontier, TIntFltH &NIdDistH)
 
int TSnap::GetWeightedShortestPath (const PNEANet Graph, const int &SrcNId, TIntFltH &NIdDistH, const TFltV &Attr)
 
double TSnap::GetWeightedFarnessCentr (const PNEANet Graph, const int &NId, const bool &IsDir, const TFltV &Attr, const bool &Normalized)
 
double TSnap::GetWeightedClosenessCentr (const PNEANet Graph, const int &NId, const bool &IsDir, const TFltV &Attr, const bool &Normalized)
 
void TSnap::GetWeightedBetweennessCentr (const PNEANet Graph, const TIntV &BtwNIdV, TIntFltH &NodeBtwH, const bool &IsDir, const bool &DoNodeCent, TIntPrFltH &EdgeBtwH, const bool &DoEdgeCent, const TFltV &Attr)
 Computes (approximate) weighted Beetweenness Centrality of all nodes and all edges of the network. More...
 
void TSnap::GetWeightedBetweennessCentr (const PNEANet Graph, TIntFltH &NodeBtwH, TIntPrFltH &EdgeBtwH, const TFltV &Attr, const bool &IsDir, const double &NodeFrac)
 
void TSnap::GetWeightedBetweennessCentr (const PNEANet Graph, TIntFltH &NodeBtwH, const TFltV &Attr, const bool &IsDir, const double &NodeFrac)
 
void TSnap::GetWeightedBetweennessCentr (const PNEANet Graph, TIntPrFltH &EdgeBtwH, const TFltV &Attr, const bool &IsDir, const double &NodeFrac)