SNAP Library 6.0, Developer Reference: TNodeNet< TNodeData

THash< TInt, TNode > NodeH

Definition: network.h:144

TNodeNet::CRef

TCRef CRef

Definition: network.h:142

TInt MxNId

Definition: network.h:143

Here is the caller graph for this function:

template<class TNodeData>

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

inlineexplicit

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

Definition at line 162 of file network.h.

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

TInt MxNId

Definition: network.h:143

TNodeNet::Reserve

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

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

Definition: network.h:278

template<class TNodeData>

TNodeNet< TNodeData >::TNodeNet ( const TNodeNet< TNodeData > & NodeNet )

inline

Definition at line 163 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:144

TInt MxNId

Definition: network.h:143

template<class TNodeData>

TNodeNet< TNodeData >::TNodeNet ( TSIn & SIn )

inline

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

Definition at line 165 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:144

TNodeNet::TNodeI::GetOutDeg

TInt MxNId

Definition: network.h:143

template<class TNodeData>

virtual TNodeNet< TNodeData >::~TNodeNet ( )

inlinevirtual

Definition at line 166 of file network.h.

166 { }

Member Function Documentation

template<class TNodeData >

int TNodeNet< TNodeData >::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 was successfully added return -1. Normally the function should return an ID of the edge added but since edges in TNodeNet have no IDs we return -1. Function aborts if SrcNId or DstNId are not nodes in the network.

Definition at line 381 of file network.h.

References TStr::Fmt(), and IAssertR.

Referenced by TTimeNet::GetSubGraph(), TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

                                                                      {
   IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
   if (IsEdge(SrcNId, DstNId)) { return -2; }
   GetNode(SrcNId).OutNIdV.AddSorted(DstNId);
   GetNode(DstNId).InNIdV.AddSorted(SrcNId);
   return -1; // no edge id
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData>

int TNodeNet< TNodeData >::AddEdge ( const TEdgeI & EdgeI )

inline

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

Definition at line 247 of file network.h.

Referenced by TNodeNet< TSecTm >::AddEdge().

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

TNodeNet::AddEdge

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

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

Definition: network.h:381

Here is the caller graph for this function:

template<class TNodeData >

int TNodeNet< TNodeData >::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 311 of file network.h.

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

Referenced by TTimeNet::GetSubGraph(), TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

                                         {
   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>

int TNodeNet< TNodeData >::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 335 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>

int TNodeNet< TNodeData >::AddNode ( const TNodeI & NodeI )

inline

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

Definition at line 209 of file network.h.

Referenced by TNodeNet< TSecTm >::AddNode().

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

TNodeNet::AddNode

int AddNode(int NId=-1)

Adds a node of ID NId to the network.

Definition: network.h:311

Here is the caller graph for this function:

template<class TNodeData >

int TNodeNet< TNodeData >::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 323 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>

TEdgeI TNodeNet< TNodeData >::BegEI ( ) const

inline

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

Definition at line 257 of file network.h.

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

TNodeNet::EndNI

TNodeI EndNI() const

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

Definition: network.h:221

TNodeNet::BegNI

TNodeI BegNI() const

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

Definition: network.h:219

int GetOutDeg() const

Returns out-degree of the current node.

Definition: network.h:80

template<class TNodeData>

TNodeI TNodeNet< TNodeData >::BegNI ( ) const

inline

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

Definition at line 219 of file network.h.

Referenced by TNodeNet< TSecTm >::BegEI(), TTimeNet::LoadArxiv(), and TTimeNet::LoadPatents().

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

THash::BegI

TIter BegI() const

Definition: hash.h:213

THash< TInt, TNode > NodeH

Definition: network.h:144

Here is the caller graph for this function:

template<class TNodeData>

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

inline

Deletes all nodes and edges from the network.

Definition at line 275 of file network.h.

275 {

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

THash< TInt, TNode > NodeH

Definition: network.h:144

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

TInt MxNId

Definition: network.h:143

THash::Clr

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

Definition: hash.h:361

template<class TNodeData >

void TNodeNet< TNodeData >::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 423 of file network.h.

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

Referenced by TTimeNet::GetSubGraph(), TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

                                                           {
   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:

Here is the caller graph for this function:

template<class TNodeData >

void TNodeNet< TNodeData >::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 390 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());
   GetNode(SrcNId).OutNIdV.DelIfIn(DstNId);
   GetNode(DstNId).InNIdV.DelIfIn(SrcNId);
   if (! IsDir) {
     GetNode(DstNId).OutNIdV.DelIfIn(SrcNId);
     GetNode(SrcNId).InNIdV.DelIfIn(DstNId);
   }
 }

Here is the call graph for this function:

template<class TNodeData >

void TNodeNet< TNodeData >::DelNode ( const int & NId )

virtual

Deletes node of ID NId from the network.

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

Definition at line 347 of file network.h.

Referenced by TTimeNet::LoadArxiv(), and TTimeNet::LoadPatents().

                                                 {
   { TNode& Node = GetNode(NId);
   for (int e = 0; e < Node.GetOutDeg(); e++) {
   const int nbr = Node.GetOutNId(e);
   if (nbr == NId) { continue; }
     TNode& N = GetNode(nbr);
     int n = N.InNIdV.SearchBin(NId);
     if (n!= -1) { N.InNIdV.Del(n); }
   }
   for (int e = 0; e < Node.GetInDeg(); e++) {
   const int nbr = Node.GetInNId(e);
   if (nbr == NId) { continue; }
     TNode& N = GetNode(nbr);
     int n = N.OutNIdV.SearchBin(NId);
     if (n!= -1) { N.OutNIdV.Del(n); }
   } }
   NodeH.DelKey(NId);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData>

void TNodeNet< TNodeData >::DelNode ( const TNode & NodeI )

inline

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

Definition at line 215 of file network.h.

Referenced by TNodeNet< TSecTm >::DelNode().

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

TNodeNet::DelNode

virtual void DelNode(const int &NId)

Deletes node of ID NId from the network.

Definition: network.h:347

Here is the caller graph for this function:

template<class TNodeData>

bool TNodeNet< TNodeData >::Empty ( ) const

inline

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

Definition at line 273 of file network.h.

273 { return GetNodes()==0; }

TNodeNet::GetNodes

int GetNodes() const

Returns the number of nodes in the network.

Definition: network.h:189

template<class TNodeData>

TEdgeI TNodeNet< TNodeData >::EndEI ( ) const

inline

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

Definition at line 259 of file network.h.

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

TNodeNet::EndNI

TNodeI EndNI() const

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

Definition: network.h:221

template<class TNodeData>

TNodeI TNodeNet< TNodeData >::EndNI ( ) const

inline

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

Definition at line 221 of file network.h.

Referenced by TNodeNet< TSecTm >::BegEI(), TNodeNet< TSecTm >::EndEI(), TTimeNet::LoadArxiv(), and TTimeNet::LoadPatents().

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

THash< TInt, TNode > NodeH

Definition: network.h:144

THash::EndI

TIter EndI() const

Definition: hash.h:218

Here is the caller graph for this function:

template<class TNodeData >

int TNodeNet< TNodeData >::GetEdges ( ) const

Returns the number of edges in the network.

Definition at line 373 of file network.h.

Referenced by TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

                                         {
   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>

TEdgeI TNodeNet< TNodeData >::GetEI ( const int & EId ) const

Not supported/implemented!

template<class TNodeData >

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

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

Definition at line 415 of file network.h.

References TNodeNet< TNodeData >::TNodeI::NodeHI.

                                                                                                          {
   const TNodeI SrcNI = GetNI(SrcNId);
   const int NodeN = SrcNI.NodeHI.GetDat().OutNIdV.SearchBin(DstNId);
   if (NodeN == -1) { return EndEI(); }
   return TEdgeI(SrcNI, EndNI(), NodeN);
 }

template<class TNodeData>

int TNodeNet< TNodeData >::GetMxNId ( ) const

inline

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

Definition at line 233 of file network.h.

233 { return MxNId; }

TInt MxNId

Definition: network.h:143

template<class TNodeData>

TNodeData& TNodeNet< TNodeData >::GetNDat ( const int & NId )

inline

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

Definition at line 229 of file network.h.

Referenced by TNodeNet< TNodeData >::TNodeI::GetInNDat(), TNodeNet< TNodeData >::TNodeI::GetNbrNDat(), TNodeNet< TNodeData >::TNodeI::GetOutNDat(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

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

THash< TInt, TNode > NodeH

Definition: network.h:144

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNodeNet::TNode::NodeDat

TNodeData NodeDat

Definition: network.h:26

Here is the caller graph for this function:

template<class TNodeData>

const TNodeData& TNodeNet< TNodeData >::GetNDat ( const int & NId ) const

inline

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

Definition at line 231 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:144

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNodeNet::TNode::NodeDat

TNodeData NodeDat

Definition: network.h:26

template<class TNodeData>

TNodeI TNodeNet< TNodeData >::GetNI ( const int & NId ) const

inline

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

Definition at line 223 of file network.h.

Referenced by TNodeNet< TSecTm >::GetRndNI().

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

THash< TInt, TNode > NodeH

Definition: network.h:144

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

Here is the caller graph for this function:

template<class TNodeData >

void TNodeNet< TNodeData >::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the network.

Definition at line 408 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>

TNode& TNodeNet< TNodeData >::GetNode ( const int & NId )

inlineprotected

Definition at line 139 of file network.h.

139 { return NodeH.GetDat(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:144

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

template<class TNodeData>

const TNode& TNodeNet< TNodeData >::GetNode ( const int & NId ) const

inline

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

Definition at line 225 of file network.h.

225 { return NodeH.GetDat(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:144

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

template<class TNodeData>

int TNodeNet< TNodeData >::GetNodes ( ) const

inline

Returns the number of nodes in the network.

Definition at line 189 of file network.h.

Referenced by TNodeNet< TSecTm >::Empty(), TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

189 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:144

THash::Len

int Len() const

Definition: hash.h:228

Here is the caller graph for this function:

template<class TNodeData>

TNodeI TNodeNet< TNodeData >::GetRndNI ( TRnd & Rnd = TInt::Rnd )

inline

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

Definition at line 268 of file network.h.

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

TNodeNet::GetNI

TNodeI GetNI(const int &NId) const

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

Definition: network.h:223

TNodeNet::GetRndNId

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

Returns an ID of a random node in the network.

Definition: network.h:266

template<class TNodeData>

int TNodeNet< TNodeData >::GetRndNId ( TRnd & Rnd = TInt::Rnd )

inline

Returns an ID of a random node in the network.

Definition at line 266 of file network.h.

Referenced by TNodeNet< TSecTm >::GetRndNI().

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

THash< TInt, TNode > NodeH

Definition: network.h:144

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 >

bool TNodeNet< TNodeData >::HasFlag ( const TGraphFlag & Flag ) const

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

Definition at line 306 of file network.h.

References HasGraphFlag.

                                                               {
   return HasGraphFlag(typename TNet, Flag);
 }

template<class TNodeData >

bool TNodeNet< TNodeData >::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 401 of file network.h.

Referenced by TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

                                                                                               {
   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>

bool TNodeNet< TNodeData >::IsNode ( const int & NId ) const

inline

Tests whether ID NId is a node.

Definition at line 217 of file network.h.

Referenced by TTimeNet::GetSubGraph(), TTimeNet::LoadAmazon(), TTimeNet::LoadArxiv(), TTimeNet::LoadBipartite(), and TTimeNet::LoadPatents().

217 { return NodeH.IsKey(NId); }

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

THash< TInt, TNode > NodeH

Definition: network.h:144

THash::IsKey

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the caller graph for this function:

template<class TNodeData >

bool TNodeNet< TNodeData >::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 433 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>

static PNet TNodeNet< TNodeData >::Load ( TSIn & SIn )

inlinestatic

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

Definition at line 172 of file network.h.

172 { return PNet(new TNodeNet(SIn)); }

TNodeNet::TNodeNet

TNodeNet()

Definition: network.h:160

TNodeNet::PNet

TPt< TNet > PNet

Definition: network.h:21

template<class TNodeData>

void TNodeNet< TNodeData >::LoadNetworkShM ( TShMIn & ShMIn )

inlineprivate

Definition at line 153 of file network.h.

Referenced by TNodeNet< TSecTm >::LoadShM().

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

Here is the caller graph for this function:

template<class TNodeData>

static PNet TNodeNet< TNodeData >::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 178 of file network.h.

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

template<class TNodeData>

static PNet TNodeNet< TNodeData >::New ( )

inlinestatic

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

Definition at line 170 of file network.h.

170 { return PNet(new TNodeNet()); }

TNodeNet::TNodeNet

TNodeNet()

Definition: network.h:160

TNodeNet::PNet

TPt< TNet > PNet

Definition: network.h:21

template<class TNodeData>

TNodeNet& TNodeNet< TNodeData >::operator= ( const TNodeNet< TNodeData > & NodeNet )

inline

Definition at line 185 of file network.h.

185 {

186 if (this!=&NodeNet) { NodeH=NodeNet.NodeH; MxNId=NodeNet.MxNId; } return *this; }

THash< TInt, TNode > NodeH

Definition: network.h:144

TInt MxNId

Definition: network.h:143

template<class TNodeData>

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

inline

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

Definition at line 278 of file network.h.

Referenced by TTimeNet::GetSubGraph(), TTimeNet::LoadAmazon(), TTimeNet::LoadPatents(), and TNodeNet< TSecTm >::TNodeNet().

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

THash< TInt, TNode > NodeH

Definition: network.h:144

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:222

Here is the caller graph for this function:

template<class TNodeData>

virtual void TNodeNet< TNodeData >::Save ( TSOut & SOut ) const

inlinevirtual

Saves the network to a (binary) stream SOut.

Reimplemented in TTimeNet.

Definition at line 168 of file network.h.

168 { 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:144

TInt MxNId

Definition: network.h:143

template<class TNodeData>

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

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

Definition at line 367 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>

void TNodeNet< TNodeData >::SortNIdByDat ( const bool & Asc = true )

inline

Sorts nodes by node data.

Definition at line 282 of file network.h.

282 { NodeH.SortByDat(Asc); }

THash< TInt, TNode > NodeH

Definition: network.h:144

THash::SortByDat

void SortByDat(const bool &Asc=true)

Definition: hash.h:292

template<class TNodeData>

void TNodeNet< TNodeData >::SortNIdById ( const bool & Asc = true )

inline

Sorts nodes by node IDs.

Definition at line 280 of file network.h.

280 { NodeH.SortByKey(Asc); }