SNAP Library 6.0, Developer Reference: TNodeEDatNet< TNodeData, TEdgeData

THash< TInt, TNode > NodeH

Definition: network.h:637

TInt MxNId

Definition: network.h:636

template<class TNodeData, class TEdgeData>

TNodeEDatNet< TNodeData, TEdgeData >::TNodeEDatNet	(	const int &	Nodes,
		const int &	Edges
	)

inlineexplicit

Constructor that reserves enough memory for a network of Nodes nodes and Edges edges.

Definition at line 653 of file network.h.

653 : MxNId(0) { Reserve(Nodes, Edges); }

TInt MxNId

Definition: network.h:636

TNodeEDatNet::Reserve

void Reserve(const int &Nodes, const int &Edges)

Reserves memory for a network of Nodes nodes and Edges edges.

Definition: network.h:789

template<class TNodeData, class TEdgeData>

TNodeEDatNet< TNodeData, TEdgeData >::TNodeEDatNet ( const TNodeEDatNet< TNodeData, TEdgeData > & NodeNet )

inline

Definition at line 654 of file network.h.

654 : MxNId(NodeNet.MxNId), NodeH(NodeNet.NodeH) { }

THash< TInt, TNode > NodeH

Definition: network.h:637

TInt MxNId

Definition: network.h:636

template<class TNodeData, class TEdgeData>

TNodeEDatNet< TNodeData, TEdgeData >::TNodeEDatNet ( TSIn & SIn )

inline

Constructor that loads the network from a (binary) stream SIn.

Definition at line 656 of file network.h.

656 : MxNId(SIn), NodeH(SIn) { }

THash< TInt, TNode > NodeH

Definition: network.h:637

TNodeEDatNet::TNodeI::GetOutDeg

TInt MxNId

Definition: network.h:636

template<class TNodeData, class TEdgeData>

virtual TNodeEDatNet< TNodeData, TEdgeData >::~TNodeEDatNet ( )

inlinevirtual

Definition at line 657 of file network.h.

657 { }

Member Function Documentation

template<class TNodeData , class TEdgeData >

int TNodeEDatNet< TNodeData, TEdgeData >::AddEdge	(	const int &	SrcNId,
		const int &	DstNId
	)

Adds an edge from node SrcNId to node DstNId to the network.

If the edge already exists return -2. If the edge does not exist and was successfully added return -1. Normally the function should return an ID of the edge added but since edges in TNodeEDatNet have no IDs we return -1. Function aborts if SrcNId or DstNId are not nodes in the network.

Definition at line 906 of file network.h.

Referenced by TNIBs::LoadGroundTruthTxt(), TNIBs::LoadInferredTxt(), and TNIBs::UpdateDiff().

                                                                                     {
   return AddEdge(SrcNId, DstNId, TEdgeData());
 }

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::AddEdge	(	const int &	SrcNId,
		const int &	DstNId,
		const TEdgeData &	EdgeDat
	)

Adds an edge and edge data from node IDs SrcNId to node DstNId.

If the edge already exists, set edges data and returns -2. If the edge does not exist and was successfully added returns -1. Normally the function should return an ID of the edge added but since edges in TNodeEDatNet have no IDs it returns -1. Function aborts if SrcNId or DstNId are not nodes in the network.

Definition at line 911 of file network.h.

References TStr::Fmt(), and IAssertR.

                                                                                                               {
   IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
   //IAssert(! IsEdge(SrcNId, DstNId));
   if (IsEdge(SrcNId, DstNId)) {
     GetEDat(SrcNId, DstNId) = EdgeDat;
     return -2;
   }
   GetNode(SrcNId).OutNIdV.AddSorted(TPair<TInt, TEdgeData>(DstNId, EdgeDat));
   GetNode(DstNId).InNIdV.AddSorted(SrcNId);
   return -1; // no edge id
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::AddEdge ( const TEdgeI & EdgeI )

inline

Adds an edge from EdgeI.GetSrcNId() to EdgeI.GetDstNId() and its edge data to the network.

Definition at line 746 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::AddEdge().

746 { return AddEdge(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), EdgeI()); }

TNodeEDatNet::AddEdge

int AddEdge(const int &SrcNId, const int &DstNId)

Adds an edge from node SrcNId to node DstNId to the network.

Definition: network.h:906

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >

int TNodeEDatNet< TNodeData, TEdgeData >::AddNode ( int NId = -1 )

Adds a node of ID NId to the network.

Returns the ID of the node being added. If NId is -1, node ID is automatically assigned. Aborts, if a node with ID NId already exists.

Definition at line 836 of file network.h.

References TStr::Fmt(), IAssertR, and TMath::Mx().

Referenced by TNIBs::Init(), TNIBs::LoadGroundTruthNodesTxt(), TNIBs::LoadGroundTruthTxt(), TNIBs::LoadInferredNodesTxt(), and TNIBs::LoadInferredTxt().

                                                        {
   if (NId == -1) {
     NId = MxNId;  MxNId++;
   } else {
     IAssertR(!IsNode(NId), TStr::Fmt("NodeId %d already exists", NId));
     MxNId = TMath::Mx(NId+1, MxNId());
   }
   NodeH.AddDat(NId, TNode(NId));
   return NId;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData >

int TNodeEDatNet< TNodeData, TEdgeData >::AddNode	(	int	NId,
		const TNodeData &	NodeDat
	)

Adds a node of ID NId and node data NodeDat to the network.

Returns the ID of the node being added. If NId is -1, node ID is automatically assigned. Aborts, if a node with ID NId already exists.

Definition at line 860 of file network.h.

References TStr::Fmt(), IAssertR, and TMath::Mx().

                                                                                  {
   if (NId == -1) {
     NId = MxNId;  MxNId++;
   } else {
     IAssertR(!IsNode(NId), TStr::Fmt("NodeId %d already exists", NId));
     MxNId = TMath::Mx(NId+1, MxNId());
   }
   NodeH.AddDat(NId, TNode(NId, NodeDat));
   return NId;
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::AddNode ( const TNodeI & NodeI )

inline

Adds a node NodeI and its node data to the network.

Definition at line 700 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::AddNode().

700 { return AddNode(NodeI.GetId(), NodeI.GetDat()); }

TNodeEDatNet::AddNode

int AddNode(int NId=-1)

Adds a node of ID NId to the network.

Definition: network.h:836

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >

int TNodeEDatNet< TNodeData, TEdgeData >::AddNodeUnchecked ( int NId = -1 )

Adds a node of ID NId to the network, noop if the node already exists.

Returns -1, if the node NId already exists. Otherwise, it returns the ID of the node being added. If NId is -1, node ID is automatically assigned.

Definition at line 848 of file network.h.

References TMath::Mx().

                                                                 {
   if (NId == -1) {
     NId = MxNId;  MxNId++;
   } else {
     if (IsNode(NId)) { return -1;}
     MxNId = TMath::Mx(NId+1, MxNId());
   }
   NodeH.AddDat(NId, TNode(NId));
   return NId;
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

TEdgeI TNodeEDatNet< TNodeData, TEdgeData >::BegEI ( ) const

inline

Returns an iterator referring to the first edge in the network.

Definition at line 756 of file network.h.

Referenced by TNIBs::BSG(), TNIBs::FG(), TNIBs::GetGroundTruthGraphAtT(), TNIBs::GetGroundTruthNetworkAtT(), TNIBs::GetInferredGraphAtT(), TNIBs::GetInferredNetworkAtT(), TNIBs::SaveGroundTruth(), TNIBs::SaveGroundTruthPajek(), TNIBs::SaveInferred(), TNIBs::SaveInferredEdges(), TNIBs::SaveInferredPajek(), and TNIBs::SG().

756 { TNodeI NI=BegNI(); while(NI<EndNI() && NI.GetOutDeg()==0) NI++; return TEdgeI(NI, EndNI()); }

int GetOutDeg() const

Returns out-degree of the current node.

Definition: network.h:559

TNodeEDatNet::BegNI

TNodeI BegNI() const

Returns an iterator referring to the first node in the network.

Definition: network.h:710

TNodeEDatNet::EndNI

TNodeI EndNI() const

Returns an iterator referring to the past-the-end node in the network.

Definition: network.h:712

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

TNodeI TNodeEDatNet< TNodeData, TEdgeData >::BegNI ( ) const

inline

Returns an iterator referring to the first node in the network.

Definition at line 710 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::BegEI().

710 { return TNodeI(NodeH.BegI(), this); }

THash::BegI

TIter BegI() const

Definition: hash.h:213

THash< TInt, TNode > NodeH

Definition: network.h:637

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::Clr	(	const bool &	DoDel = `true`,
		const bool &	ResetDat = `true`
	)

inline

Deletes all nodes and edges from the network.

Definition at line 786 of file network.h.

Referenced by TNIBs::Init(), TNIBs::LoadGroundTruthNodesTxt(), TNIBs::LoadGroundTruthTxt(), TNIBs::LoadInferredNodesTxt(), and TNIBs::LoadInferredTxt().

786 {

787 MxNId = 0; NodeH.Clr(DoDel, -1, ResetDat); }

THash< TInt, TNode > NodeH

Definition: network.h:637

References TVec< TVal, TSizeTy >::Del(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetInDeg(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetInNId(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutDeg(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutNId(), and TVec< TVal, TSizeTy >::SearchBin().

TInt MxNId

Definition: network.h:636

THash::Clr

void Clr(const bool &DoDel=true, const int &NoDelLim=-1, const bool &ResetDat=true)

Definition: hash.h:361

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >

void TNodeEDatNet< TNodeData, TEdgeData >::Defrag ( const bool & OnlyNodeLinks = false )

Defragments the network.

After performing many node and edge insertions and deletions to a network, the network data structure will be fragmented in memory. This function compacts down the network data structure and frees unneeded memory.

Definition at line 1005 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TNode::InNIdV, TNodeEDatNet< TNodeData, TEdgeData >::TNode::OutNIdV, and TVec< TVal, TSizeTy >::Pack().

                                                                          {
   for (int n = NodeH.FFirstKeyId(); NodeH.FNextKeyId(n);) {
     TNode& Node = NodeH[n];
     Node.InNIdV.Pack();  Node.OutNIdV.Pack();
   }
   if (! OnlyNodeLinks && ! NodeH.IsKeyIdEqKeyN()) {
     NodeH.Defrag();
   }
 }

Here is the call graph for this function:

template<class TNodeData , class TEdgeData >

void TNodeEDatNet< TNodeData, TEdgeData >::DelEdge	(	const int &	SrcNId,
		const int &	DstNId,
		const bool &	IsDir = `true`
	)

Deletes an edge from node IDs SrcNId to DstNId from the network.

If the edge (SrcNId, DstNId) does not exist in the network function still completes. But the function aborts if SrcNId or DstNId are not nodes in the network.

Definition at line 924 of file network.h.

References TStr::Fmt(), and IAssertR.

                                                                                                         {
   IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
   int pos = GetNIdPos(GetNode(SrcNId).OutNIdV, DstNId);
   if (pos != -1) { GetNode(SrcNId).OutNIdV.Del(pos); }
   pos = GetNode(DstNId).InNIdV.SearchBin(SrcNId);
   if (pos != -1) { GetNode(DstNId).InNIdV.Del(pos); }
   if (! IsDir) {
     pos = GetNIdPos(GetNode(DstNId).OutNIdV, SrcNId);
     if (pos != -1) { GetNode(DstNId).OutNIdV.Del(pos); }
     pos = GetNode(SrcNId).InNIdV.SearchBin(DstNId);
     if (pos != -1) { GetNode(SrcNId).InNIdV.Del(pos); }
   }
 }

Here is the call graph for this function:

template<class TNodeData , class TEdgeData >

void TNodeEDatNet< TNodeData, TEdgeData >::DelNode ( const int & NId )

Deletes node of ID NId from the network.

If the node of ID NId does not exist the function aborts.

Definition at line 878 of file network.h.

                                                                {
   const TNode& Node = GetNode(NId);
   for (int out = 0; out < Node.GetOutDeg(); out++) {
     const int nbr = Node.GetOutNId(out);
     if (nbr == NId) { continue; }
     TIntV& NIdV = GetNode(nbr).InNIdV;
     const int pos = NIdV.SearchBin(NId);
     if (pos != -1) { NIdV.Del(pos); }
   }
   for (int in = 0; in < Node.GetInDeg(); in++) {
     const int nbr = Node.GetInNId(in);
     if (nbr == NId) { continue; }
     TNIdDatPrV& NIdDatV = GetNode(nbr).OutNIdV;
     const int pos = GetNIdPos(NIdDatV, NId);
     if (pos != -1) { NIdDatV.Del(pos); }
   }
   NodeH.DelKey(NId);
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::DelNode ( const TNode & NodeI )

inline

Deletes node of ID NodeI.GetId() from the network.

Definition at line 706 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::DelNode().

706 { DelNode(NodeI.GetId()); }

TNodeEDatNet::DelNode

void DelNode(const int &NId)

Deletes node of ID NId from the network.

Definition: network.h:878

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

bool TNodeEDatNet< TNodeData, TEdgeData >::Empty ( ) const

inline

Tests whether the network is empty (has zero nodes).

Definition at line 784 of file network.h.

784 { return GetNodes()==0; }

TNodeEDatNet::GetNodes

int GetNodes() const

Returns the number of nodes in the network.

Definition: network.h:680

template<class TNodeData, class TEdgeData>

TEdgeI TNodeEDatNet< TNodeData, TEdgeData >::EndEI ( ) const

inline

Returns an iterator referring to the past-the-end edge in the network.

Definition at line 758 of file network.h.

Referenced by TNIBs::BSG(), TNIBs::FG(), TNIBs::GetGroundTruthGraphAtT(), TNIBs::GetGroundTruthNetworkAtT(), TNIBs::GetInferredGraphAtT(), TNIBs::GetInferredNetworkAtT(), TNIBs::SaveGroundTruth(), TNIBs::SaveGroundTruthPajek(), TNIBs::SaveInferred(), TNIBs::SaveInferredEdges(), TNIBs::SaveInferredPajek(), and TNIBs::SG().

758 { return TEdgeI(EndNI(), EndNI()); }

TNodeEDatNet::EndNI

TNodeI EndNI() const

Returns an iterator referring to the past-the-end node in the network.

Definition: network.h:712

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

TNodeI TNodeEDatNet< TNodeData, TEdgeData >::EndNI ( ) const

inline

Returns an iterator referring to the past-the-end node in the network.

Definition at line 712 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::BegEI(), and TNodeEDatNet< TStr, TFltFltH >::EndEI().

712 { return TNodeI(NodeH.EndI(), this); }

THash::EndI

TIter EndI() const

Definition: hash.h:218

THash< TInt, TNode > NodeH

Definition: network.h:637

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData>

bool TNodeEDatNet< TNodeData, TEdgeData >::GetEDat	(	const int &	SrcNId,
		const int &	DstNId,
		TEdgeData &	EdgeDat
	)		const

Returns edge data in Data for the edge from node IDs SrcNId to DstNId.

Returns true, if the edge was found. Otherwise, returns false.

Definition at line 953 of file network.h.

References TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutEDat(), and TNodeEDatNet< TNodeData, TEdgeData >::TNode::OutNIdV.

Referenced by TNIBs::BSG(), TNIBs::ComputePerformanceNId(), TNIBs::FG(), TNIBs::GenCascade(), TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetInEDat(), TNIBs::LabelBurstAutomaton(), TNIBs::LoadGroundTruthTxt(), TNIBs::LoadInferredTxt(), TNIBs::SG(), and TNIBs::UpdateDiff().

                                                                                                                {
   if (! IsEdge(SrcNId, DstNId)) { return false; }
   const TNode& N = GetNode(SrcNId);
   EdgeDat = N.GetOutEDat(GetNIdPos(N.OutNIdV, DstNId));
   return true;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData>

TEdgeData & TNodeEDatNet< TNodeData, TEdgeData >::GetEDat	(	const int &	SrcNId,
		const int &	DstNId
	)

Returns edge data for the edge from node IDs SrcNId to DstNId.

Definition at line 961 of file network.h.

References Assert, TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutEDat(), and TNodeEDatNet< TNodeData, TEdgeData >::TNode::OutNIdV.

                                                                                            {
   Assert(IsEdge(SrcNId, DstNId));
   TNode& N = GetNode(SrcNId);
   return N.GetOutEDat(GetNIdPos(N.OutNIdV, DstNId));
 }

Here is the call graph for this function:

template<class TNodeData , class TEdgeData>

const TEdgeData & TNodeEDatNet< TNodeData, TEdgeData >::GetEDat	(	const int &	SrcNId,
		const int &	DstNId
	)		const

Returns edge data for the edge from node IDs SrcNId to DstNId.

Definition at line 968 of file network.h.

References Assert, TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutEDat(), and TNodeEDatNet< TNodeData, TEdgeData >::TNode::OutNIdV.

                                                                                                        {
   Assert(IsEdge(SrcNId, DstNId));
   const TNode& N = GetNode(SrcNId);
   return N.GetOutEDat(GetNIdPos(N.OutNIdV, DstNId));
 }

Here is the call graph for this function:

template<class TNodeData , class TEdgeData >

int TNodeEDatNet< TNodeData, TEdgeData >::GetEdges ( ) const

Returns the number of edges in the network.

Definition at line 898 of file network.h.

Referenced by TNIBs::LoadGroundTruthTxt(), and TNIBs::LoadInferredTxt().

                                                        {
   int edges=0;
   for (int N=NodeH.FFirstKeyId(); NodeH.FNextKeyId(N); ) {
     edges+=NodeH[N].GetOutDeg(); }
   return edges;
 }

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

TEdgeI TNodeEDatNet< TNodeData, TEdgeData >::GetEI ( const int & EId ) const

Not supported/implemented!

template<class TNodeData , class TEdgeData >

TNodeEDatNet< TNodeData, TEdgeData >::TEdgeI TNodeEDatNet< TNodeData, TEdgeData >::GetEI	(	const int &	SrcNId,
		const int &	DstNId
	)		const

Returns an iterator referring to edge (SrcNId, DstNId) in the network.

Definition at line 982 of file network.h.

References TVec< TVal, TSizeTy >::Len(), and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::NodeHI.

                                                                                                                                        {
   const TNodeI SrcNI = GetNI(SrcNId);
   int NodeN = -1;
   //SrcNI.NodeHI.GetDat().OutNIdV.SearchBin(DstNId);
   const TNIdDatPrV& NIdDatV = SrcNI.NodeHI.GetDat().OutNIdV;
   int LValN=0, RValN=NIdDatV.Len()-1;
   while (RValN>=LValN){
     int ValN=(LValN+RValN)/2;
     if (DstNId==NIdDatV[ValN].Val1){ NodeN=ValN; break; }
     if (DstNId<NIdDatV[ValN].Val1){RValN=ValN-1;} else {LValN=ValN+1;}
   }
   if (NodeN == -1) { return EndEI(); }
   else { return TEdgeI(SrcNI, EndNI(), NodeN); }
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::GetMxNId ( ) const

inline

Returns an ID that is larger than any node ID in the network.

Definition at line 724 of file network.h.

724 { return MxNId; }

TInt MxNId

Definition: network.h:636

template<class TNodeData, class TEdgeData>

TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::GetNDat ( const int & NId )

inline

Returns node data for the node of ID NId in the network.

Definition at line 720 of file network.h.

Referenced by TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetInNDat(), TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetNbrNDat(), and TNodeEDatNet< TNodeData, TEdgeData >::TNodeI::GetOutNDat().

720 { return NodeH.GetDat(NId).NodeDat; }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNodeEDatNet::TNode::NodeDat

THash< TInt, TNode > NodeH

Definition: network.h:637

TNodeData NodeDat

Definition: network.h:502

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

const TNodeData& TNodeEDatNet< TNodeData, TEdgeData >::GetNDat ( const int & NId ) const

inline

Returns node data for the node of ID NId in the network.

Definition at line 722 of file network.h.

722 { return NodeH.GetDat(NId).NodeDat; }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNodeEDatNet::TNode::NodeDat

THash< TInt, TNode > NodeH

Definition: network.h:637

TNodeData NodeDat

Definition: network.h:502

template<class TNodeData, class TEdgeData>

TNodeI TNodeEDatNet< TNodeData, TEdgeData >::GetNI ( const int & NId ) const

inline

Returns an iterator referring to the node of ID NId in the network.

Definition at line 714 of file network.h.

Referenced by TNIBs::ComputePerformanceNId(), TNIBs::GenCascade(), and TNodeEDatNet< TStr, TFltFltH >::GetRndNI().

714 { return TNodeI(NodeH.GetI(NId), this); }

THash< TInt, TNode > NodeH

Definition: network.h:637

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::GetNIdPos	(	const TVec< TPair< TInt, TEdgeData > > &	NIdV,
		const int &	NId
	)

staticprotected

Definition at line 823 of file network.h.

Referenced by TNodeEDatNet< TNodeData, TEdgeData >::TNode::IsOutNId().

                                                                                                            {
   int LValN=0, RValN = NIdV.Len()-1;
   while (RValN >= LValN) {
     const int ValN = (LValN+RValN)/2;
     const int CurNId = NIdV[ValN].Val1;
     if (NId == CurNId) { return ValN; }
     if (NId < CurNId) { RValN=ValN-1; }
     else { LValN=ValN+1; }
   }
   return -1;
 }

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >

void TNodeEDatNet< TNodeData, TEdgeData >::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the network.

Definition at line 998 of file network.h.

References TVec< TVal, TSizeTy >::Add(), and TVec< TVal, TSizeTy >::Reserve().

                                                                   {
   NIdV.Reserve(GetNodes(), 0);
   for (int N=NodeH.FFirstKeyId(); NodeH.FNextKeyId(N); ) {
     NIdV.Add(NodeH.GetKey(N)); }
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

TNode& TNodeEDatNet< TNodeData, TEdgeData >::GetNode ( const int & NId )

inlineprotected

Definition at line 632 of file network.h.

632 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:637

template<class TNodeData, class TEdgeData>

const TNode& TNodeEDatNet< TNodeData, TEdgeData >::GetNode ( const int & NId ) const

inline

Returns node element for the node of ID NId in the network.

Definition at line 716 of file network.h.

716 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:637

template<class TNodeData, class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::GetNodes ( ) const

inline

Returns the number of nodes in the network.

Definition at line 680 of file network.h.

Referenced by TNIBs::BSG(), TNIBs::ComputePerformanceNId(), TNodeEDatNet< TStr, TFltFltH >::Empty(), TNIBs::FG(), TNIBs::GenCascade(), TNIBs::GetNodes(), TNIBs::LoadGroundTruthNodesTxt(), TNIBs::LoadGroundTruthTxt(), TNIBs::LoadInferredNodesTxt(), and TNIBs::LoadInferredTxt().

680 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:637

THash::Len

int Len() const

Definition: hash.h:228

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

TNodeI TNodeEDatNet< TNodeData, TEdgeData >::GetRndNI ( TRnd & Rnd = TInt::Rnd )

inline

Returns an interator referring to a random node in the network.

Definition at line 779 of file network.h.

779 { return GetNI(GetRndNId(Rnd)); }

TNodeEDatNet::GetNI

TNodeI GetNI(const int &NId) const

Returns an iterator referring to the node of ID NId in the network.

Definition: network.h:714

TNodeEDatNet::GetRndNId

int GetRndNId(TRnd &Rnd=TInt::Rnd)

Returns an ID of a random node in the network.

Definition: network.h:777

template<class TNodeData, class TEdgeData>

int TNodeEDatNet< TNodeData, TEdgeData >::GetRndNId ( TRnd & Rnd = TInt::Rnd )

inline

Returns an ID of a random node in the network.

Definition at line 777 of file network.h.

Referenced by TNIBs::GenCascade(), and TNodeEDatNet< TStr, TFltFltH >::GetRndNI().

777 { return NodeH.GetKey(NodeH.GetRndKeyId(Rnd, 0.8)); }

THash< TInt, TNode > NodeH

Definition: network.h:637

THash::GetRndKeyId

int GetRndKeyId(TRnd &Rnd) const

Get an index of a random element. If the hash table has many deleted keys, this may take a long time...

Definition: hash.h:444

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:252

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >

bool TNodeEDatNet< TNodeData, TEdgeData >::HasFlag ( const TGraphFlag & Flag ) const

Allows for run-time checking the type of the network (see the TGraphFlag for flags).

Definition at line 818 of file network.h.

References HasGraphFlag.

                                                                              {
   return HasGraphFlag(typename TNet, Flag);
 }

template<class TNodeData , class TEdgeData >

bool TNodeEDatNet< TNodeData, TEdgeData >::IsEdge	(	const int &	SrcNId,
		const int &	DstNId,
		const bool &	IsDir = `true`
	)		const

Tests whether an edge from node IDs SrcNId to DstNId exists in the network.

Definition at line 939 of file network.h.

Referenced by TNIBs::BSG(), TNIBs::ComputePerformanceNId(), TNIBs::FG(), TNIBs::SG(), and TNIBs::UpdateDiff().

                                                                                                              {
   if (! IsNode(SrcNId) || ! IsNode(DstNId)) { return false; }
   if (IsDir) { return GetNode(SrcNId).IsOutNId(DstNId); }
   else { return GetNode(SrcNId).IsOutNId(DstNId) || GetNode(DstNId).IsOutNId(SrcNId); }
 }

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

bool TNodeEDatNet< TNodeData, TEdgeData >::IsNode ( const int & NId ) const

inline

Tests whether ID NId is a node.

Definition at line 708 of file network.h.

Referenced by TNIBs::UpdateDiff().

708 { return NodeH.IsKey(NId); }

References TStr::CStr(), EAssertR, ErrNotify(), TStr::Fmt(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetId(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetInDeg(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetInNId(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutDeg(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::GetOutNId(), TNodeEDatNet< TNodeData, TEdgeData >::TNode::InNIdV, TVec< TVal, TSizeTy >::IsSorted(), and TNodeEDatNet< TNodeData, TEdgeData >::TNode::OutNIdV.

THash< TInt, TNode > NodeH

Definition: network.h:637

THash::IsKey

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >

bool TNodeEDatNet< TNodeData, TEdgeData >::IsOk ( const bool & ThrowExcept = true ) const

Checks the network data structure for internal consistency.

For each node in the network check that its neighbors are also nodes in the network.

Definition at line 1016 of file network.h.

                                                                            {
   bool RetVal = true;
   for (int N = NodeH.FFirstKeyId(); NodeH.FNextKeyId(N); ) {
     const TNode& Node = NodeH[N];
     if (! Node.OutNIdV.IsSorted()) {
       const TStr Msg = TStr::Fmt("Out-neighbor list of node %d is not sorted.", Node.GetId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
     }
     if (! Node.InNIdV.IsSorted()) {
       const TStr Msg = TStr::Fmt("In-neighbor list of node %d is not sorted.", Node.GetId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
     }
     // check out-edges
     int prevNId = -1;
     for (int e = 0; e < Node.GetOutDeg(); e++) {
       if (! IsNode(Node.GetOutNId(e))) {
         const TStr Msg = TStr::Fmt("Out-edge %d --> %d: node %d does not exist.",
           Node.GetId(), Node.GetOutNId(e), Node.GetOutNId(e));
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       if (e > 0 && prevNId == Node.GetOutNId(e)) {
         const TStr Msg = TStr::Fmt("Node %d has duplidate out-edge %d --> %d.",
           Node.GetId(), Node.GetId(), Node.GetOutNId(e));
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       prevNId = Node.GetOutNId(e);
     }
     // check in-edges
     prevNId = -1;
     for (int e = 0; e < Node.GetInDeg(); e++) {
       if (! IsNode(Node.GetInNId(e))) {
         const TStr Msg = TStr::Fmt("In-edge %d <-- %d: node %d does not exist.",
           Node.GetId(), Node.GetInNId(e), Node.GetInNId(e));
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       if (e > 0 && prevNId == Node.GetInNId(e)) {
         const TStr Msg = TStr::Fmt("Node %d has duplidate in-edge %d <-- %d.",
           Node.GetId(), Node.GetId(), Node.GetInNId(e));
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       prevNId = Node.GetInNId(e);
     }
   }
   return RetVal;
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

static PNet TNodeEDatNet< TNodeData, TEdgeData >::Load ( TSIn & SIn )

inlinestatic

Static constructor that loads the network from a stream SIn and returns a pointer to it.

Definition at line 663 of file network.h.

663 { return PNet(new TNet(SIn)); }

TNodeEDatNet::PNet

TPt< TNet > PNet

Definition: network.h:496

TNodeEDatNet::TNet

TNodeEDatNet< TNodeData, TEdgeData > TNet

Definition: network.h:495

template<class TNodeData, class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::LoadNetworkShM ( TShMIn & ShMIn )

inlineprivate

Definition at line 645 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::LoadShM().

                                      {
     MxNId = TInt(ShMIn);
     TNodeFunctor f;
     NodeH.LoadShM(ShMIn, f);
   }

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

static PNet TNodeEDatNet< TNodeData, TEdgeData >::LoadShM ( TShMIn & ShMIn )

inlinestatic

Static constructor that loads the network from shared memory.

The object is read-only. It does not support operations that edit the edge vectors of nodes or perform illegal operations on the NodeH, EdgeH (deletion or swapping keys).

Definition at line 669 of file network.h.

                                      {
     TNet* Network = new TNet();
     Network->LoadNetworkShM(ShMIn);
     return PNet(Network);
   }

template<class TNodeData, class TEdgeData>

static PNet TNodeEDatNet< TNodeData, TEdgeData >::New ( )

inlinestatic

Static constructor that returns a pointer to the network. Call: TPt <TNodeEDatNet<TNodeData, TEdgeData> > Net = TNodeEDatNet<TNodeData, TEdgeData>::New().

Definition at line 661 of file network.h.

Referenced by TNIBs::GetGroundTruthNetworkAtT(), TNIBs::GetInferredNetworkAtT(), and main().

661 { return PNet(new TNet()); }

TNodeEDatNet::PNet

TPt< TNet > PNet

Definition: network.h:496

TNodeEDatNet::TNet

TNodeEDatNet< TNodeData, TEdgeData > TNet

Definition: network.h:495

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

TNodeEDatNet& TNodeEDatNet< TNodeData, TEdgeData >::operator= ( const TNodeEDatNet< TNodeData, TEdgeData > & NodeNet )

inline

Definition at line 676 of file network.h.

676 { if (this!=&NodeNet) {

677 NodeH=NodeNet.NodeH; MxNId=NodeNet.MxNId; } return *this; }

THash< TInt, TNode > NodeH

Definition: network.h:637

TInt MxNId

Definition: network.h:636

template<class TNodeData, class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::Reserve	(	const int &	Nodes,
		const int &	Edges
	)

inline

Reserves memory for a network of Nodes nodes and Edges edges.

Definition at line 789 of file network.h.

Referenced by TNodeEDatNet< TStr, TFltFltH >::TNodeEDatNet().

789 { if (Nodes>0) { NodeH.Gen(Nodes/2); } }

THash< TInt, TNode > NodeH

Definition: network.h:637

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:222

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>

virtual void TNodeEDatNet< TNodeData, TEdgeData >::Save ( TSOut & SOut ) const

inlinevirtual

Saves the network to a (binary) stream SOut.

Definition at line 659 of file network.h.

Referenced by TNIBs::Save().

659 { MxNId.Save(SOut); NodeH.Save(SOut); }

TInt::Save

void Save(TSOut &SOut) const

Definition: dt.h:1153

THash::Save

void Save(TSOut &SOut) const

Definition: hash.h:183

THash< TInt, TNode > NodeH

Definition: network.h:637

TInt MxNId

Definition: network.h:636

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::SetAllEDat ( const TEdgeData & EdgeDat )

Sets edge data for all the edges in the network to EDat.

Definition at line 975 of file network.h.

                                                                             {
   for (TEdgeI EI = BegEI(); EI < EndEI(); EI++) {
     EI() = EdgeDat;
   }
 }

template<class TNodeData , class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::SetEDat	(	const int &	SrcNId,
		const int &	DstNId,
		const TEdgeData &	EdgeDat
	)

Sets edge data for the edge between nodes SrcNId and DstNId in the network.

Definition at line 946 of file network.h.

References TStr::Fmt(), and IAssertR.

                                                                                                                {
   IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
   IAssertR(IsEdge(SrcNId, DstNId), TStr::Fmt("Edge between %d and %d does not exist.", SrcNId, DstNId).CStr());
   GetEDat(SrcNId, DstNId) = EdgeDat;
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData >

void TNodeEDatNet< TNodeData, TEdgeData >::SetNDat	(	const int &	NId,
		const TNodeData &	NodeDat
	)

Sets node data for the node of ID NId in the network.

Definition at line 872 of file network.h.

References TStr::Fmt(), and IAssertR.

                                                                                          {
   IAssertR(IsNode(NId), TStr::Fmt("NodeId %d does not exist.", NId).CStr());
   NodeH.GetDat(NId).NodeDat = NodeDat;
 }

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::SortNIdByDat ( const bool & Asc = true )

inline

Sorts nodes by node data.

Definition at line 793 of file network.h.

793 { NodeH.SortByDat(Asc); }

THash< TInt, TNode > NodeH

Definition: network.h:637

THash::SortByDat

void SortByDat(const bool &Asc=true)

Definition: hash.h:292

template<class TNodeData, class TEdgeData>

void TNodeEDatNet< TNodeData, TEdgeData >::SortNIdById ( const bool & Asc = true )

inline

Sorts nodes by node IDs.

Definition at line 791 of file network.h.

791 { NodeH.SortByKey(Asc); }