SNAP Library , Developer Reference  2013-01-07 14:03:36
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
alg.h File Reference
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  TSnap::TSnapDetail::TDelSelfEdges< PGraph, IsMultiGraph >
struct  TSnap::TSnapDetail::TDelSelfEdges< PGraph, true >

Namespaces

namespace  TSnap
 Main namespace for all the Snap global entities.
namespace  TSnap::TSnapDetail

Functions

template<class PGraph >
int TSnap::CntInDegNodes (const PGraph &Graph, const int &NodeInDeg)
 Returns the number of nodes with in-degree NodeInDeg.
template<class PGraph >
int TSnap::CntOutDegNodes (const PGraph &Graph, const int &NodeOutDeg)
 Returns the number of nodes with out-degree NodeOutDeg.
template<class PGraph >
int TSnap::CntDegNodes (const PGraph &Graph, const int &NodeDeg)
 Returns the number of nodes with degree NodeDeg.
template<class PGraph >
int TSnap::CntNonZNodes (const PGraph &Graph)
 Returns the number of nodes with degree greater than 0.
template<class PGraph >
int TSnap::CntEdgesToSet (const PGraph &Graph, const int &NId, const TIntSet &NodeSet)
 TODO ROK document CntEdgesToSet()
template<class PGraph >
int TSnap::GetMxDegNId (const PGraph &Graph)
 Returns a randomly chosen node from all the nodes with the maximum degree.
template<class PGraph >
int TSnap::GetMxInDegNId (const PGraph &Graph)
 Returns a randomly chosen node from all the nodes with the maximum in-degree.
template<class PGraph >
int TSnap::GetMxOutDegNId (const PGraph &Graph)
 Returns a randomly chosen node from all the nodes with the maximum out-degree.
template<class PGraph >
void TSnap::GetInDegCnt (const PGraph &Graph, TIntPrV &DegToCntV)
 TODO ROK document GetInDegCnt()
template<class PGraph >
void TSnap::GetOutDegCnt (const PGraph &Graph, TIntPrV &DegToCntV)
 TODO ROK document GetOutDegCnt()
template<class PGraph >
void TSnap::GetDegCnt (const PGraph &Graph, TIntPrV &DegToCntV)
 TODO ROK document GetDegCnt()
template<class PGraph >
void TSnap::GetDegSeqV (const PGraph &Graph, TIntV &DegV)
 TODO ROK document GetDegSeqV()
template<class PGraph >
void TSnap::GetDegSeqV (const PGraph &Graph, TIntV &InDegV, TIntV &OutDegV)
 TODO ROK document GetDegSeqV()
template<class PGraph >
void TSnap::GetNodeInDegV (const PGraph &Graph, TIntPrV &NIdInDegV)
template<class PGraph >
void TSnap::GetNodeOutDegV (const PGraph &Graph, TIntPrV &NIdOutDegV)
template<class PGraph >
int TSnap::CntUniqUndirEdges (const PGraph &Graph)
 Counts unique undirected edges in the graph Graph.
template<class PGraph >
int TSnap::CntUniqDirEdges (const PGraph &Graph)
 Counts unique directed edges in the graph Graph.
template<class PGraph >
int TSnap::CntUniqBiDirEdges (const PGraph &Graph)
 Counts unique bidirectional edges in the graph Graph.
template<class PGraph >
int TSnap::CntSelfEdges (const PGraph &Graph)
template<class PGraph >
PGraph TSnap::GetUnDir (const PGraph &Graph)
template<class PGraph >
void TSnap::MakeUnDir (const PGraph &Graph)
template<class PGraph >
void TSnap::AddSelfEdges (const PGraph &Graph)
template<class PGraph >
void TSnap::DelSelfEdges (const PGraph &Graph)
template<class PGraph >
void TSnap::DelBiDirEdges (const PGraph &Graph)
template<class PGraph >
void TSnap::DelNodes (PGraph &Graph, const TIntV &NIdV)
template<class PGraph >
void TSnap::DelZeroDegNodes (PGraph &Graph)
template<class PGraph >
void TSnap::DelDegKNodes (PGraph &Graph, const int &OutDegK, const int &InDegK)
template<class PGraph >
bool TSnap::IsTree (const PGraph &Graph, int &RootNId)
template<class PGraph >
int TSnap::GetTreeRootNId (const PGraph &Graph)
template<class PGraph >
void TSnap::GetTreeSig (const PGraph &Graph, const int &RootNId, TIntV &Sig)
template<class PGraph >
void TSnap::GetTreeSig (const PGraph &Graph, const int &RootNId, TIntV &Sig, TIntPrV &NodeMap)