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, TFlt >	NodePrCH

Detailed Description

template<class PGraph>
class TNetConstraint< PGraph >

Definition at line 852 of file triad.h.

Constructor & Destructor Documentation

template<class PGraph >

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

Definition at line 871 of file triad.h.

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

                                                                                  : Graph(GraphPt) {
  CAssert(! HasGraphFlag(typename PGraph::TObj, gfMultiGraph)); // must not be multigraph
  if (CalcaAll) {
    CalcConstraints();
  }
}

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 907 of file triad.h.

References TMath::Sqr().

                                                                           {
  if (NId1==NId2 || NodePrCH.IsKey(TIntPr(NId1, NId2))) {
    return;
  }
  typename PGraph::TObj::TNodeI NI1 = Graph->GetNI(NId1);
  double Constraint = 0.0;
  if (NI1.IsOutNId(NId2)) { // is direct edge
    Constraint += 1.0/(double) NI1.GetOutDeg();
  }
  const double SrcC = 1.0/(double) NI1.GetOutDeg();
  for (int e = 0; e < NI1.GetOutDeg(); e++) {
    const int MidNId = NI1.GetOutNId(e);
    if (MidNId == NId1 || MidNId == NId2) { continue; }
    const typename PGraph::TObj::TNodeI MidNI = Graph->GetNI(MidNId);
    if (MidNI.IsOutNId(NId2)) {
      Constraint += SrcC * (1.0/(double)MidNI.GetOutDeg());
    }
  }
  if (Constraint==0) { return; }
  Constraint = TMath::Sqr(Constraint);
  NodePrCH.AddDat(TIntPr(NId1, NId2), Constraint);
}

Here is the call graph for this function:

template<class PGraph >

void TNetConstraint< PGraph >::CalcConstraints

(

)

Definition at line 931 of file triad.h.

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

                                             {
  // add edges
  for (typename PGraph::TObj::TEdgeI EI = Graph->BegEI(); EI < Graph->EndEI(); EI++) {
    AddConstraint(EI.GetSrcNId(), EI.GetDstNId());
    AddConstraint(EI.GetDstNId(), EI.GetSrcNId());
  }
  // add open triads
  for (typename PGraph::TObj::TNodeI NI = Graph->BegNI(); NI < Graph->EndNI(); NI++) {
    for (int i = 0; i < NI.GetDeg();  i++) {
      const int NId1 = NI.GetNbrNId(i);
      for (int j = 0; j < NI.GetDeg();  j++) {
        const int NId2 = NI.GetNbrNId(j);
        AddConstraint(NId1, NId2);
      }
    }
  }
  NodePrCH.SortByKey();
}

Here is the caller graph for this function:

template<class PGraph >

void TNetConstraint< PGraph >::CalcConstraints

(

const int &

NId

)

Definition at line 952 of file triad.h.

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

                                                           {
  typename PGraph::TObj::TNodeI StartNI = Graph->GetNI(NId);
  TIntSet SeenSet;
  for (int e = 0; e < StartNI.GetOutDeg(); e++) {
    typename PGraph::TObj::TNodeI MidNI = Graph->GetNI(StartNI.GetOutNId(e));
    AddConstraint(NId, MidNI.GetId());
    for (int i = 0; i < MidNI.GetOutDeg();  i++) {
      const int EndNId = MidNI.GetOutNId(i);
      if (! SeenSet.IsKey(EndNId)) {
        AddConstraint(NId, EndNId);
        SeenSet.AddKey(EndNId);
      }
    }
  }
}

Here is the call graph for this function:

template<class PGraph >

void TNetConstraint< PGraph >::Dump

(

)

const

Definition at line 969 of file triad.h.

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

                                        {
  printf("Edge network constraint: (%d, %d)\n", Graph->GetNodes(), Graph->GetEdges());
  for (int e = 0; e < NodePrCH.Len(); e++) {
    printf("  %4d %4d  :  %f\n", NodePrCH.GetKey(e).Val1(), NodePrCH.GetKey(e).Val2(), NodePrCH[e].Val);
  }
  printf("\n");
}

Here is the caller graph for this function:

template<class PGraph>

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

inline

Definition at line 859 of file triad.h.

{ return NodePrCH[ConstraintN]; }

template<class PGraph >

double TNetConstraint< PGraph >::GetEdgeC	(	const int &	NId1,
		const int &	NId2
	)		const

Definition at line 879 of file triad.h.

                                                                              {
  if (NodePrCH.IsKey(TIntPr(NId1, NId2))) {
    return NodePrCH.GetDat(TIntPr(NId1, NId2)); }
  else {
    return 0.0; }
}

template<class PGraph >

double TNetConstraint< PGraph >::GetNodeC

(

const int &

NId

)

const

Definition at line 887 of file triad.h.

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

                                                            {
  typename PGraph::TObj::TNodeI NI1 = Graph->GetNI(NId);
  if (NI1.GetOutDeg() == 0) { return 0.0; }
  int KeyId = -1;
  for (int k = 0; k<NI1.GetOutDeg(); k++) {
    KeyId = NodePrCH.GetKeyId(TIntPr(NI1.GetId(), NI1.GetOutNId(k)));
    if (KeyId > -1) { break; }
  }
  if (KeyId < 0) { return 0.0; }
  double Constraint = NodePrCH[KeyId];
  for (int i = KeyId-1; i >-1 && NodePrCH.GetKey(i).Val1()==NId; i--) {
    Constraint += NodePrCH[i];
  }
  for (int i = KeyId+1; i < NodePrCH.Len() && NodePrCH.GetKey(i).Val1()==NId; i++) {
    Constraint += NodePrCH[i];
  }
  return Constraint;
}

Here is the caller graph for this function:

template<class PGraph>

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

inline

Definition at line 860 of file triad.h.

References THash< TKey, TDat, THashFunc >::GetKey().

{ return NodePrCH.GetKey(ConstraintN); }

Here is the call graph for this function:

template<class PGraph>

int TNetConstraint< PGraph >::Len ( ) const

inline

Definition at line 858 of file triad.h.

References THash< TKey, TDat, THashFunc >::Len().

{ return NodePrCH.Len(); }

Here is the call graph for this function:

template<class PGraph >

void TNetConstraint< PGraph >::Test ( )

static

Definition at line 980 of file triad.h.

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

                                  {
  PUNGraph G = TUNGraph::New();
  G->AddNode(0); G->AddNode(1); G->AddNode(2); G->AddNode(3);
  G->AddNode(4); G->AddNode(5); G->AddNode(6);
  G->AddEdge(0,1); G->AddEdge(0,2); G->AddEdge(0,3); G->AddEdge(0,4); G->AddEdge(0,5); G->AddEdge(0,6);
  G->AddEdge(1,2); G->AddEdge(1,5);  G->AddEdge(1,6);
  G->AddEdge(2,4);
  TNetConstraint<PUNGraph> NetConstraint(G, true);
  // NetConstraint.CalcConstraints(0);
  NetConstraint.Dump();
  printf("middle node network constraint: %f\n", NetConstraint.GetNodeC(0));
}

Here is the call graph for this function:

Member Data Documentation

template<class PGraph>

PGraph TNetConstraint< PGraph >::Graph

Definition at line 854 of file triad.h.

template<class PGraph>

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

Definition at line 855 of file triad.h.

---

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

• snap-core/triad.h