TSnap::IsBipart< TGraph > | Tests (at compile time) if the graph is a bipartite graph type |
TSnap::IsBipart< TBPGraph > | |
TSnap::IsDirected< TGraph > | Tests (at compile time) if the graph is directed |
TSnap::IsDirected< TBigNet< TNodeData, IsDir > > | |
TSnap::IsDirected< TBigNet< TNodeData, true > > | |
TSnap::IsDirected< TNEANet > | |
TSnap::IsDirected< TNEGraph > | |
TSnap::IsDirected< TNGraph > | |
TSnap::IsDirected< TNodeEDatNet< TNodeData, TEdgeData > > | |
TSnap::IsDirected< TNodeEdgeNet< TNodeData, TEdgeData > > | |
TSnap::IsDirected< TNodeNet< TNodeData > > | |
TSnap::IsDirected< TTimeNENet > | |
TSnap::IsDirected< TTimeNet > | |
TSnap::IsEdgeDat< TGraph > | Tests (at compile time) if the graph is a network with data on edges |
TSnap::IsEdgeDat< TNodeEDatNet< TNodeData, TEdgeData > > | |
TSnap::IsEdgeDat< TNodeEdgeNet< TNodeData, TEdgeData > > | |
TSnap::IsEdgeDat< TTimeNENet > | |
TSnap::IsMultiGraph< TGraph > | Tests (at compile time) if the graph is a multigraph with multiple edges between the same nodes |
TSnap::IsMultiGraph< TNEANet > | |
TSnap::IsMultiGraph< TNEGraph > | |
TSnap::IsMultiGraph< TNodeEdgeNet< TNodeData, TEdgeData > > | |
TSnap::IsMultiGraph< TTimeNENet > | |
TSnap::IsNodeDat< TGraph > | Tests (at compile time) if the graph is a network with data on nodes |
TSnap::IsNodeDat< TBigNet< TNodeData, IsDir > > | |
TSnap::IsNodeDat< TNodeEDatNet< TNodeData, TEdgeData > > | |
TSnap::IsNodeDat< TNodeEdgeNet< TNodeData, TEdgeData > > | |
TSnap::IsNodeDat< TNodeNet< TNodeData > > | |
TSnap::IsNodeDat< TTimeNENet > | |
TSnap::IsNodeDat< TTimeNet > | |
TSnap::IsSources< TGraph > | Tests (at compile time) if the nodes store only out-edges, but not in-edges |
PHash< TKey, TDat > | |
PVec< TVal > | |
T8BitCodec< TEncoding_ > | |
TNEANet::TAFltI | NodeEdge Attr iterator. Iterate through all node for one attr value |
TAGM | |
TAGMFast | |
TAGMFit | |
TAGMUtil | |
TNEANet::TAIntI | Node/Edge Attr iterator. Iterate through all node for one attr value |
TApp | |
TAPt< TRec > | |
TArtPointVisitor | Articulation point Depth-First-Search visitor class |
TAscFlt | |
TNEANet::TAStrI | Node/Edge Attr iterator. Iterate through all node for one attr value |
TB1Def | |
TB2Def | |
TB32Set | |
TB4Def | |
TB8Set | |
TBiConVisitor | Biconnected componetns Depth-First-Search visitor class |
TBigNet< TNodeData, IsDir > | Big Network |
TBigStrPool | |
TBlobBs | |
TBlobPt | |
TBool | |
TBPGraph | Bipartite graph |
TBreathFS< PGraph > | |
TBSet | |
TCache< TKey, TDat, THashFunc > | |
TCallbackNotify | |
TCascade | |
TCh | |
TChA | |
TChAIn | |
TChRet | |
TCliqueOverlap | |
TCluster | |
TCmp< T > | |
TGStat::TCmpByVal | |
TCmpKeyDatByDat< TVal1, TVal2 > | |
TCmpPairByVal2< TVal1, TVal2 > | Compares the pair by the second value |
TCmpTripleByVal2< TVal1, TVal2, TVal3 > | Compares the triple by the second value |
TCmpTripleByVal3< TVal1, TVal2, TVal3 > | Compares the triple by the third value |
TSnap::TSnapDetail::TCNMQMatrix::TCmtyDat | |
TCnCom | |
TSnap::TSnapDetail::TCNMQMatrix | |
TCodecBase | |
TCodecWrapper< TCodecImpl_ > | |
TComb | |
TCon | |
TConManip | |
TConv_Pt64Ints32 | |
TSnap::TSnapDetail::TConvertSubGraph< POutGraph, PInGraph, IsMultiGraph > | |
TSnap::TSnapDetail::TConvertSubGraph< POutGraph, PInGraph, false > | |
TCorr | |
TCRef | |
TCs | |
TLocClustStat::TCutInfo | |
TD34GraphCounter | |
TD3Graph | |
TD4Graph | |
TDbStr | |
TDefaultHashFunc< TKey > | |
TSnap::TSnapDetail::TDelSelfEdges< PGraph, IsMultiGraph > | |
TSnap::TSnapDetail::TDelSelfEdges< PGraph, true > | |
TDGHashGraphCounter | |
TDGraphCounter | |
TDir | |
TNEGraph::TEdge | |
TNodeEdgeNet< TNodeData, TEdgeData >::TEdge | |
TNEANet::TEdge | |
TBigNet< TNodeData, IsDir >::TEdgeI | Edge iterator |
TUNGraph::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TNGraph::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TNEGraph::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TBPGraph::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TNodeNet< TNodeData >::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TNodeEdgeNet< TNodeData, TEdgeData >::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TNEANet::TEdgeI | Edge iterator. Only forward iteration (operator++) is supported |
TEdgeInfo | |
TEncoding_CP1250 | |
TEncoding_CP437 | |
TEncoding_CP852 | |
TEncoding_ISO8859_1 | |
TEncoding_ISO8859_2 | |
TEncoding_ISO8859_3 | |
TEncoding_ISO8859_4 | |
TEncoding_YuAscii | |
TEnv | |
TEq< T > | |
TExcept | |
TExeTm | |
TExp | |
TExpBi | |
TExpEnv | |
TExpHelp | |
TExpHelpItem | |
TExpHelpObj | |
TExpVal | |
TKronMaxLL::TFEval | |
TFfGGen | |
TFFile | |
TFFileDesc | |
TFHash< TKey, TFDat, TVDat > | |
TFHashKey< TKey, TFDat, TVDat > | |
TFile | |
TFIn | |
TFInOut | |
TFlt | |
TFltRect | |
TForestFire | |
TFOut | |
TFPathNotify | |
TFRec< THd, TRec > | |
TFRnd | |
TFSet | |
TFullColMatrix | |
TFunc< TFuncPt > | |
TGBlobBs | |
TGEq< T > | |
TSnap::TSnapDetail::TGetSubGraph< PGraph, IsMultiGraph > | |
TSnap::TSnapDetail::TGetSubGraph< PGraph, false > | |
TGHash< TDat > | Graph Hash Table |
TGnuPlot | |
TGnuPlot::TGpSeries | |
TGnuPlot::TGpSeriesCmp | |
TGraphAnf< PGraph > | |
TGraphAttributes | |
TGraphEnumUtils | |
TGraphKey | Small Directed Graphs |
TGStat | |
TGStatVec | Graph Statistics Sequence |
TGtr< T > | |
TGUtil | Graph Utilities |
THash< TKey, TDat, THashFunc > | |
THashKeyDat< TKey, TDat > | |
THash< TKey, TDat, THashFunc >::THashKeyDatCmp | |
THashKeyDatI< TKey, TDat > | |
THashSet< TKey, THashFunc > | |
THashSetKey< TKey > | |
THashSetKeyI< TKey > | |
THeap< TVal, TCmp > | Simple heap data structure |
THist | |
THitInfo | |
THtmlDoc | |
THtmlHldV | |
THtmlLx | |
THtmlLxChDef | |
THtmlTok | |
THttp | |
THttpChDef | |
THttpChRet | |
THttpEx | |
THttpLx | |
THttpResp | |
THttpRq | |
TILx | |
TILxSymSt | |
TInt | |
TJsonVal | |
TJulianDate | |
TKCore< PGraph > | |
TKeyDat< TKey, TDat > | |
TKeyDatFl< TKey, TDat, THashFunc > | |
TKroneckerLL | !!!!! MYUNGHWAN, CHECK! |
TKronMaxLL | |
TKronMomentsFit | |
TKronMtx | |
TKronNoise | |
TLAMisc | |
TLEq< T > | |
TLFlt | |
TLinAlg | |
TLinReg | |
TLnRet | |
TLocClust | Local Spectral Clustering algorithm |
TLocClustStat | Local-Spectral-Clustering statistics of a given Graph |
TLogNotify | |
TLogRegFit | |
TLogRegPredict | |
TLss< T > | |
TLst< TVal > | |
TLstNd< TVal > | |
TLxChDef | |
TLxSymStr | |
TMacro | |
TMAGAffMtx | |
TMAGFitBern | |
TMAGNodeBern | |
TMAGNodeBeta | |
TMAGNodeSimple | |
TMAGParam< TNodeAttr > | |
TMath | |
TMatrix | |
TMBlobBs | |
TMd5 | |
TMd5Sig | |
TMem | |
TMemIn | |
TMemOut | |
TMIn | |
TMom | |
TMOut | |
TNativeCallbackNotify | |
TNcpGraphsBase | Local-Spectral-Clustering for a set of graphs (loads ncp-*.tab files) |
TNEANet | TODO TNEANet describe time complexity for basic operations |
TNEGraph | Node Edge Graph |
TNEq< T > | |
TNetConstraint< PGraph > | |
TNetInfBs | |
TNGraph | Directed Node Graph |
TNGraphMtx | |
TNIBs | |
TBigNet< TNodeData, IsDir >::TNode | Node container class |
TUNGraph::TNode | |
TNGraph::TNode | |
TNEGraph::TNode | |
TBPGraph::TNode | |
TNodeNet< TNodeData >::TNode | |
TNodeEDatNet< TNodeData, TEdgeData >::TNode | |
TNodeEdgeNet< TNodeData, TEdgeData >::TNode | |
TNEANet::TNode | |
TUniTrie< TItem_ >::TNode | |
TNodeEDatNet< TNodeData, TEdgeData > | Node Edge Network (directed graph, TNGraph with data on nodes and edges) |
TNodeEdgeNet< TNodeData, TEdgeData > | Node Edge Network (directed multigraph, TNEGraph with data on nodes and edges) |
TBigNet< TNodeData, IsDir >::TNodeI | Node iterator |
TUNGraph::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNGraph::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNEGraph::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TBPGraph::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNodeNet< TNodeData >::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNodeEDatNet< TNodeData, TEdgeData >::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNEANet::TNodeI | Node iterator. Only forward iteration (operator++) is supported |
TNodeInfo | |
TNodeNet< TNodeData > | Node Network (directed graph, TNGraph with data on nodes only) |
TLocClustStat::TNodeSweep | |
TNotify | |
TNSException | |
TNullNotify | |
TNumericalStuff | |
TOLx | |
TOnExeStop | |
TPackVec< TVal > | |
TPair< TVal1, TVal2 > | |
TPairHashImpl1 | Computes a hash code from a pair of hash codes |
TPairHashImpl2 | Computes a hash code from a pair of hash codes |
TPp | |
TPpTag | |
TPpVal | |
TPreproc | |
TPt< TRec > | |
TQQueue< TVal > | |
TQuad< TVal1, TVal2, TVal3, TVal4 > | |
TRnd | |
TRStr | |
TSBase | |
TSccVisitor< PGraph, OnlyCount > | Strongly connected componetns Depht-First-Search visitor class |
TSecTm | |
TSFlt | |
TSHashKeyDat< TKey, TDat > | |
TSigmoid | |
TSimpleGraph | Simple directed/undirected graph defined by its edges |
TSIn | |
TSInOut | |
TSInt | |
TSnapQueue< TVal > | Fast Queue used by the TBreathFS (uses memcpy to move objects TVal around) |
TSNodeTest | |
TSOut | |
TSOutMnp | |
TSparseColMatrix | |
TSparseGroup< TVal, GroupSize > | |
TSparseHash< TKey, TDat, GroupSize > | |
TSparseOps< TKey, TDat > | |
TSparseRowMatrix | |
TSparseSet< TKey, GroupSize > | |
TSparseSVD | |
TSparseTable< TVal, GroupSize > | |
TSparseTableI< TVal, GroupSize > | |
TSpecFunc | |
TSs | |
TSubGraphEnum< TGraphCounter >::TSSet | |
TSsParser | |
TSStack< TVal > | |
TSStr | |
TStaticAssert< true > | |
TStaticAssertTest< IntVal > | |
TStatTest | |
TStdErrNotify | |
TStdIn | |
TStdNotify | |
TStdOut | |
TStr | |
TStrCache | |
TStrHash< TDat, TStringPool, THashFunc > | |
TStrHashF_DJB | |
TStrHashF_Md5 | |
TStrHashF_OldGLib | |
TStrIn | |
TStrPool | |
TStrPool64 | |
TStrUtil | String helper functions and utilities. Quick and ditry! |
TUniChDb::TSubcatHelper | |
TSubGraphEnum< TGraphCounter > | |
TSubGraphsEnum | Connected Sub-graph Enumeration |
TSvd | |
TSubGraphEnum< TGraphCounter >::TSVec | |
TTimeNENet | |
TTimeNet | |
TTm | |
TTimeNet::TTmBucket | |
TTmInfo | |
TTmProfiler | |
TTmStopWatch | |
TTmTimer | |
TTree< TVal > | |
TTriple< TVal1, TVal2, TVal3 > | |
TTuple< TVal, NVals > | |
TTypeNm< Type > | |
TUniChDb::TUcdFileReader | |
TUCh | |
TUInt | |
TUInt64 | |
TUndirFFire | Simulates a single Forest Fire on a undirected graph starting for a given starting node (does not densify!) |
TUNGraph | Undirected graph |
TUNGraphMtx | |
TUniCaseFolding | |
TUniChDb | |
TUniChInfo | |
TUnicode | |
TUniCodec | |
TUnicodeDef | |
TUnicodeException | |
TUnionFind | Union Find class (Disjoint-set data structure) |
TUniTrie< TItem_ > | |
TUrl | |
TUrlEnv | |
TUrlLx | |
TUrlLxChDef | |
TUStr | |
TVec< TVal, TSizeTy > | Vector is a sequence TVal objects representing an array that can change in size |
TGLib_OLD::TVec< TVal > | |
TVecElt< TVector_ > | |
TVecElt< TChA > | |
TVecElt< TVec< TDat > > | |
TVecHashF_OldGLib< TVec > | |
TGLib_OLD::TVecPool< TVal > | |
TVecPool< TVal, TSizeTy > | Vector Pool |
anonymous_namespace{unicode.cpp}::TVectorBuilder | |
anonymous_namespace{unicode.cpp}::TVectorBuilder2 | |
TVoid | |
TVVec< TVal > | |
TVVVec< TVal > | |
TWCh | |
TWChA | |
TWebPg | |
TXmlChDef | |
TXmlDoc | |
TXmlLx | |
TXmlObjSer | |
TXmlObjSerTagNm | |
TXmlParser | |
TXmlTok | |
TZipIn | |
TZipOut | |