| 
    SNAP Library 2.3, Developer Reference
    2014-06-16 11:58:46
    
   SNAP, a general purpose, high performance system for analysis and manipulation of large networks 
   | 
 
#include <kcore.h>

Public Member Functions | |
| TKCore (const PGraph &_Graph) | |
| int | GetCurK () const | 
| int | GetNextCore () | 
| int | GetCoreK (const int &K) | 
| int | GetCoreNodes () const | 
| Gets the number of nodes in the K-core (for the current value of K).  More... | |
| int | GetCoreEdges () const | 
| Gets the number of edges in the K-core (for the current value of K).  More... | |
| const TIntV & | GetNIdV () const | 
| Returns the IDs of the nodes in the current K-core.  More... | |
| PGraph | GetCoreG () const | 
| Returrns the graph of the current K-core.  More... | |
Private Member Functions | |
| void | Init () | 
Private Attributes | |
| PGraph | Graph | 
| TIntH | DegH | 
| TInt | CurK | 
| TIntV | NIdV | 
K-Core decomposition of a network. K-core is defined as a maximal subgraph of the original graph where every node points to at least K other nodes. K-core is obtained by repeatedly deleting nodes of degree < K from the graph until no nodes of degree < K exist. If the input graph is directed we treat it as undirected multigraph, i.e., we ignore the edge directions but there may be up to two edges between a pair of nodes. See the kcores example (examples/kcores/kcores.cpp) for how to use the code. For example: for (KCore(Graph); KCore.GetNextCore()!=0; ) { } will produce a sequence of K-cores for K=1...
Definition at line 20 of file kcore.h.
References TKCore< PGraph >::Init().

| int TKCore< PGraph >::GetCoreEdges | ( | ) | const | 
Gets the number of edges in the K-core (for the current value of K).
Definition at line 53 of file kcore.h.
Referenced by TSnap::GetKCoreEdges().

      
  | 
  inline | 
Returrns the graph of the current K-core.
Definition at line 39 of file kcore.h.
References TSnap::GetSubGraph(), TKCore< PGraph >::Graph, and TKCore< PGraph >::NIdV.

| int TKCore< PGraph >::GetCoreK | ( | const int & | K | ) | 
Directly generates the core of order K. The function has the same effect as calling GetNextCore() K times.
Definition at line 94 of file kcore.h.
Referenced by TSnap::GetKCore().

      
  | 
  inline | 
Gets the number of nodes in the K-core (for the current value of K).
Definition at line 33 of file kcore.h.
References TVec< TVal, TSizeTy >::Len(), and TKCore< PGraph >::NIdV.
Referenced by TSnap::GetKCoreNodes().


      
  | 
  inline | 
Gets the currrent value of K. For every call of GetNextCore() the value of K increases by 1.
Definition at line 23 of file kcore.h.
References TKCore< PGraph >::CurK.
Referenced by TSnap::GetKCoreEdges(), and TSnap::GetKCoreNodes().

| int TKCore< PGraph >::GetNextCore | ( | ) | 
Returns the number of nodes in the next (K=K+1) core. The function starts with K=1-core and every time we call it it increases the value of K by 1 and generates the core. The function proceeds until GetCoreNodes() returns 0. Return value of the function is the size (the number of nodes) in the K-core (for the current value of K).
Definition at line 62 of file kcore.h.
Referenced by TSnap::GetKCoreEdges(), and TSnap::GetKCoreNodes().

Returns the IDs of the nodes in the current K-core.
Definition at line 37 of file kcore.h.
References TKCore< PGraph >::NIdV.
Referenced by TSnap::GetKCore().

      
  | 
  private | 
Definition at line 43 of file kcore.h.
Referenced by TKCore< PGraph >::TKCore().

Definition at line 15 of file kcore.h.
Referenced by TKCore< PGraph >::GetCurK().
      
  | 
  private | 
Definition at line 13 of file kcore.h.
Referenced by TKCore< PGraph >::GetCoreG().
Definition at line 16 of file kcore.h.
Referenced by TKCore< PGraph >::GetCoreG(), TKCore< PGraph >::GetCoreNodes(), and TKCore< PGraph >::GetNIdV().