| 
    SNAP Library 2.0, Developer Reference
    2013-05-13 16:33:57
    
   SNAP, a general purpose, high performance system for analysis and manipulation of large networks 
   | 
  
  
  
 

Go to the source code of this file.
Classes | |
| class | TCnCom | 
| class | TArtPointVisitor | 
| Articulation point Depth-First-Search visitor class.  More... | |
| class | TBiConVisitor | 
| Biconnected componetns Depth-First-Search visitor class.  More... | |
| class | TSccVisitor< PGraph, OnlyCount > | 
| Strongly connected componetns Depht-First-Search visitor class.  More... | |
Namespaces | |
| namespace | TSnap | 
| Main namespace for all the Snap global entities.  | |
Typedefs | |
| typedef TVec< TCnCom > | TCnComV | 
Functions | |
| template<class PGraph > | |
| void | TSnap::GetNodeWcc (const PGraph &Graph, const int &NId, TIntV &CnCom) | 
| Returns (via output parameter CnCom) all nodes that are in the same connected component as node NId.   | |
| template<class PGraph > | |
| bool | TSnap::IsConnected (const PGraph &Graph) | 
| Tests whether the Graph is (weakly) connected.   | |
| template<class PGraph > | |
| bool | TSnap::IsWeaklyConn (const PGraph &Graph) | 
| Tests whether the Graph is weakly connected.   | |
| template<class PGraph > | |
| void | TSnap::GetWccSzCnt (const PGraph &Graph, TIntPrV &WccSzCnt) | 
| Returns a distribution of weakly connected component sizes.   | |
| template<class PGraph > | |
| void | TSnap::GetWccs (const PGraph &Graph, TCnComV &CnComV) | 
| Returns all weakly connected components in a Graph.   | |
| template<class PGraph > | |
| void | TSnap::GetSccSzCnt (const PGraph &Graph, TIntPrV &SccSzCnt) | 
| Returns a distribution of strongly connected component sizes.   | |
| template<class PGraph > | |
| void | TSnap::GetSccs (const PGraph &Graph, TCnComV &CnComV) | 
| Returns all strongly connected components in a Graph.   | |
| template<class PGraph > | |
| double | TSnap::GetMxWccSz (const PGraph &Graph) | 
| Returns the fraction of nodes in the largest weakly connected component of a Graph.   | |
| template<class PGraph > | |
| PGraph | TSnap::GetMxWcc (const PGraph &Graph) | 
| Returns a graph representing the largest weakly connected component on an input Graph.   | |
| template<class PGraph > | |
| PGraph | TSnap::GetMxScc (const PGraph &Graph) | 
| Returns a graph representing the largest strongly connected component on an input Graph.   | |
| template<class PGraph > | |
| PGraph | TSnap::GetMxBiCon (const PGraph &Graph) | 
| Returns a graph representing the largest bi-connected component on an input Graph.   | |
| void | TSnap::GetBiConSzCnt (const PUNGraph &Graph, TIntPrV &SzCntV) | 
| Returns a distribution of bi-connected component sizes.   | |
| void | TSnap::GetBiCon (const PUNGraph &Graph, TCnComV &BiCnComV) | 
| Returns all bi-connected components of a Graph.   | |
| void | TSnap::GetArtPoints (const PUNGraph &Graph, TIntV &ArtNIdV) | 
| Returns articulation points of a Graph.   | |
| void | TSnap::GetEdgeBridges (const PUNGraph &Graph, TIntPrV &EdgeV) | 
| Returns bridge edges of a Graph.   | |
| void | TSnap::Get1CnComSzCnt (const PUNGraph &Graph, TIntPrV &SzCntV) | 
| Distribution of sizes of 1-components, maximal number of components that can be disconnected from the Graph by removing a single edge.   | |
| void | TSnap::Get1CnCom (const PUNGraph &Graph, TCnComV &Cn1ComV) | 
| Returns 1-components: maximal connected components of that can be disconnected from the Graph by removing a single edge.   | |
| PUNGraph | TSnap::GetMxBiCon (const PUNGraph &Graph, const bool &RenumberNodes=false) | 
| Returns a graph representing the largest bi-connected component on an undirected Graph.   | |