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
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
TNetConstraint< PGraph > Class Template Reference

#include <triad.h>

Collaboration diagram for TNetConstraint< PGraph >:

Public Member Functions

 TNetConstraint (const PGraph &GraphPt, const bool &CalcaAll=true)
 
int Len () const
 
double GetC (const int &ConstraintN) const
 
TIntPr GetNodePr (const int &ConstraintN) const
 
double GetEdgeC (const int &NId1, const int &NId2) const
 
double GetNodeC (const int &NId) const
 
void AddConstraint (const int &NId1, const int &NId2)
 
void CalcConstraints ()
 
void CalcConstraints (const int &NId)
 
void Dump () const
 

Static Public Member Functions

static void Test ()
 

Public Attributes

PGraph Graph
 
THash< TIntPr, TFltNodePrCH
 

Detailed Description

template<class PGraph>
class TNetConstraint< PGraph >

Definition at line 463 of file triad.h.

Constructor & Destructor Documentation

template<class PGraph >
TNetConstraint< PGraph >::TNetConstraint ( const PGraph &  GraphPt,
const bool &  CalcaAll = true 
)

Definition at line 482 of file triad.h.

References TNetConstraint< PGraph >::CalcConstraints(), CAssert, gfMultiGraph, and HasGraphFlag.

482  : Graph(GraphPt) {
483  CAssert(! HasGraphFlag(typename PGraph::TObj, gfMultiGraph)); // must not be multigraph
484  if (CalcaAll) {
485  CalcConstraints();
486  }
487 }
void CalcConstraints()
Definition: triad.h:542
PGraph Graph
Definition: triad.h:465
have explicit edges (multigraph): TNEGraph, TNodeEdgeNet
Definition: gbase.h:14
#define HasGraphFlag(TGraph, Flag)
For quick testing of the properties of the graph/network object (see TGraphFlag). ...
Definition: gbase.h:38
#define CAssert(Cond)
Definition: bd.h:302

Here is the call graph for this function:

Member Function Documentation

template<class PGraph >
void TNetConstraint< PGraph >::AddConstraint ( const int &  NId1,
const int &  NId2 
)

Definition at line 518 of file triad.h.

References TMath::Sqr().

518  {
519  if (NId1==NId2 || NodePrCH.IsKey(TIntPr(NId1, NId2))) {
520  return;
521  }
522  typename PGraph::TObj::TNodeI NI1 = Graph->GetNI(NId1);
523  double Constraint = 0.0;
524  if (NI1.IsOutNId(NId2)) { // is direct edge
525  Constraint += 1.0/(double) NI1.GetOutDeg();
526  }
527  const double SrcC = 1.0/(double) NI1.GetOutDeg();
528  for (int e = 0; e < NI1.GetOutDeg(); e++) {
529  const int MidNId = NI1.GetOutNId(e);
530  if (MidNId == NId1 || MidNId == NId2) { continue; }
531  const typename PGraph::TObj::TNodeI MidNI = Graph->GetNI(MidNId);
532  if (MidNI.IsOutNId(NId2)) {
533  Constraint += SrcC * (1.0/(double)MidNI.GetOutDeg());
534  }
535  }
536  if (Constraint==0) { return; }
537  Constraint = TMath::Sqr(Constraint);
538  NodePrCH.AddDat(TIntPr(NId1, NId2), Constraint);
539 }
TPair< TInt, TInt > TIntPr
Definition: ds.h:83
PGraph Graph
Definition: triad.h:465
static double Sqr(const double &x)
Definition: xmath.h:12
Definition: ds.h:32
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
bool IsKey(const TKey &Key) const
Definition: hash.h:216
TDat & AddDat(const TKey &Key)
Definition: hash.h:196

Here is the call graph for this function:

template<class PGraph >
void TNetConstraint< PGraph >::CalcConstraints ( )

Definition at line 542 of file triad.h.

Referenced by TNetConstraint< PGraph >::TNetConstraint().

542  {
543  // add edges
544  for (typename PGraph::TObj::TEdgeI EI = Graph->BegEI(); EI < Graph->EndEI(); EI++) {
545  AddConstraint(EI.GetSrcNId(), EI.GetDstNId());
546  AddConstraint(EI.GetDstNId(), EI.GetSrcNId());
547  }
548  // add open triads
549  for (typename PGraph::TObj::TNodeI NI = Graph->BegNI(); NI < Graph->EndNI(); NI++) {
550  for (int i = 0; i < NI.GetDeg(); i++) {
551  const int NId1 = NI.GetNbrNId(i);
552  for (int j = 0; j < NI.GetDeg(); j++) {
553  const int NId2 = NI.GetNbrNId(j);
554  AddConstraint(NId1, NId2);
555  }
556  }
557  }
559 }
PGraph Graph
Definition: triad.h:465
void AddConstraint(const int &NId1, const int &NId2)
Definition: triad.h:518
void SortByKey(const bool &Asc=true)
Definition: hash.h:245
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466

Here is the caller graph for this function:

template<class PGraph >
void TNetConstraint< PGraph >::CalcConstraints ( const int &  NId)

Definition at line 563 of file triad.h.

References THashSet< TKey, THashFunc >::AddKey(), and THashSet< TKey, THashFunc >::IsKey().

563  {
564  typename PGraph::TObj::TNodeI StartNI = Graph->GetNI(NId);
565  TIntSet SeenSet;
566  for (int e = 0; e < StartNI.GetOutDeg(); e++) {
567  typename PGraph::TObj::TNodeI MidNI = Graph->GetNI(StartNI.GetOutNId(e));
568  AddConstraint(NId, MidNI.GetId());
569  for (int i = 0; i < MidNI.GetOutDeg(); i++) {
570  const int EndNId = MidNI.GetOutNId(i);
571  if (! SeenSet.IsKey(EndNId)) {
572  AddConstraint(NId, EndNId);
573  SeenSet.AddKey(EndNId);
574  }
575  }
576  }
577 }
PGraph Graph
Definition: triad.h:465
bool IsKey(const TKey &Key) const
Definition: shash.h:1142
void AddConstraint(const int &NId1, const int &NId2)
Definition: triad.h:518
int AddKey(const TKey &Key)
Definition: shash.h:1248

Here is the call graph for this function:

template<class PGraph >
void TNetConstraint< PGraph >::Dump ( ) const

Definition at line 580 of file triad.h.

Referenced by TNetConstraint< PGraph >::Test().

580  {
581  printf("Edge network constraint: (%d, %d)\n", Graph->GetNodes(), Graph->GetEdges());
582  for (int e = 0; e < NodePrCH.Len(); e++) {
583  printf(" %4d %4d : %f\n", NodePrCH.GetKey(e).Val1(), NodePrCH.GetKey(e).Val2(), NodePrCH[e].Val);
584  }
585  printf("\n");
586 }
PGraph Graph
Definition: triad.h:465
TVal1 Val1
Definition: ds.h:34
TVal2 Val2
Definition: ds.h:35
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
int Len() const
Definition: hash.h:186
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the caller graph for this function:

template<class PGraph>
double TNetConstraint< PGraph >::GetC ( const int &  ConstraintN) const
inline

Definition at line 470 of file triad.h.

References TNetConstraint< PGraph >::NodePrCH.

470 { return NodePrCH[ConstraintN]; }
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
template<class PGraph >
double TNetConstraint< PGraph >::GetEdgeC ( const int &  NId1,
const int &  NId2 
) const

Definition at line 490 of file triad.h.

490  {
491  if (NodePrCH.IsKey(TIntPr(NId1, NId2))) {
492  return NodePrCH.GetDat(TIntPr(NId1, NId2)); }
493  else {
494  return 0.0; }
495 }
TPair< TInt, TInt > TIntPr
Definition: ds.h:83
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
Definition: ds.h:32
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
bool IsKey(const TKey &Key) const
Definition: hash.h:216
template<class PGraph >
double TNetConstraint< PGraph >::GetNodeC ( const int &  NId) const

Definition at line 498 of file triad.h.

Referenced by TNetConstraint< PGraph >::Test().

498  {
499  typename PGraph::TObj::TNodeI NI1 = Graph->GetNI(NId);
500  if (NI1.GetOutDeg() == 0) { return 0.0; }
501  int KeyId = -1;
502  for (int k = 0; k<NI1.GetOutDeg(); k++) {
503  KeyId = NodePrCH.GetKeyId(TIntPr(NI1.GetId(), NI1.GetOutNId(k)));
504  if (KeyId > -1) { break; }
505  }
506  if (KeyId < 0) { return 0.0; }
507  double Constraint = NodePrCH[KeyId];
508  for (int i = KeyId-1; i >-1 && NodePrCH.GetKey(i).Val1()==NId; i--) {
509  Constraint += NodePrCH[i];
510  }
511  for (int i = KeyId+1; i < NodePrCH.Len() && NodePrCH.GetKey(i).Val1()==NId; i++) {
512  Constraint += NodePrCH[i];
513  }
514  return Constraint;
515 }
TPair< TInt, TInt > TIntPr
Definition: ds.h:83
PGraph Graph
Definition: triad.h:465
int GetKeyId(const TKey &Key) const
Definition: hash.h:420
TVal1 Val1
Definition: ds.h:34
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
int Len() const
Definition: hash.h:186
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the caller graph for this function:

template<class PGraph>
TIntPr TNetConstraint< PGraph >::GetNodePr ( const int &  ConstraintN) const
inline

Definition at line 471 of file triad.h.

References THash< TKey, TDat, THashFunc >::GetKey(), and TNetConstraint< PGraph >::NodePrCH.

471 { return NodePrCH.GetKey(ConstraintN); }
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the call graph for this function:

template<class PGraph>
int TNetConstraint< PGraph >::Len ( ) const
inline

Definition at line 469 of file triad.h.

References THash< TKey, TDat, THashFunc >::Len(), and TNetConstraint< PGraph >::NodePrCH.

469 { return NodePrCH.Len(); }
THash< TIntPr, TFlt > NodePrCH
Definition: triad.h:466
int Len() const
Definition: hash.h:186

Here is the call graph for this function:

template<class PGraph >
void TNetConstraint< PGraph >::Test ( )
static

Definition at line 591 of file triad.h.

References TUNGraph::AddEdge(), TUNGraph::AddNode(), TNetConstraint< PGraph >::Dump(), TNetConstraint< PGraph >::GetNodeC(), and TUNGraph::New().

591  {
592  PUNGraph G = TUNGraph::New();
593  G->AddNode(0); G->AddNode(1); G->AddNode(2); G->AddNode(3);
594  G->AddNode(4); G->AddNode(5); G->AddNode(6);
595  G->AddEdge(0,1); G->AddEdge(0,2); G->AddEdge(0,3); G->AddEdge(0,4); G->AddEdge(0,5); G->AddEdge(0,6);
596  G->AddEdge(1,2); G->AddEdge(1,5); G->AddEdge(1,6);
597  G->AddEdge(2,4);
598  TNetConstraint<PUNGraph> NetConstraint(G, true);
599  // NetConstraint.CalcConstraints(0);
600  NetConstraint.Dump();
601  printf("middle node network constraint: %f\n", NetConstraint.GetNodeC(0));
602 }
int AddNode(int NId=-1)
Adds a node of ID NId to the graph.
Definition: graph.cpp:8
static PUNGraph New()
Static constructor that returns a pointer to the graph. Call: PUNGraph Graph = TUNGraph::New().
Definition: graph.h:149
int AddEdge(const int &SrcNId, const int &DstNId)
Adds an edge between node IDs SrcNId and DstNId to the graph.
Definition: graph.cpp:84

Here is the call graph for this function:

Member Data Documentation

template<class PGraph>
PGraph TNetConstraint< PGraph >::Graph

Definition at line 465 of file triad.h.

template<class PGraph>
THash<TIntPr, TFlt> TNetConstraint< PGraph >::NodePrCH

The documentation for this class was generated from the following file: