SNAP Library 3.0, Developer Reference: TDirNet Class Reference

TAttrPair SAttrE

Definition: network.h:3370

TAttr SAttrN

Definition: network.h:3369

THash< TInt, TNode > NodeH

Definition: network.h:3368

TInt MxNId

Definition: network.h:3367

Here is the caller graph for this function:

TDirNet::TDirNet	(	const int &	Nodes,
		const int &	Edges
	)

inlineexplicit

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

Definition at line 3377 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::Reserve().

3377 : MxNId(0), SAttrN(), SAttrE() { Reserve(Nodes, Edges); }

TDirNet::Reserve

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

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

Definition: network.h:3495

TAttrPair SAttrE

Definition: network.h:3370

TAttr SAttrN

Definition: network.h:3369

TInt MxNId

Definition: network.h:3367

Here is the call graph for this function:

TDirNet::TDirNet ( const TDirNet & Graph )

inline

Definition at line 3378 of file network.h.

3378 : MxNId(Graph.MxNId), NodeH(Graph.NodeH), SAttrN(), SAttrE() { }

TAttrPair SAttrE

Definition: network.h:3370

TAttr SAttrN

Definition: network.h:3369

THash< TInt, TNode > NodeH

Definition: network.h:3368

TInt MxNId

Definition: network.h:3367

TDirNet::TDirNet ( TSIn & SIn )

inline

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

Definition at line 3380 of file network.h.

3380 : MxNId(SIn), NodeH(SIn), SAttrN(SIn), SAttrE(SIn) { }

TAttrPair SAttrE

Definition: network.h:3370

TAttr SAttrN

Definition: network.h:3369

THash< TInt, TNode > NodeH

Definition: network.h:3368

TDirNet::TNodeI::GetOutDeg

TInt MxNId

Definition: network.h:3367

Member Function Documentation

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

Adds an edge from node IDs 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 TDirNet have no IDs we return -1. Function aborts if SrcNId or DstNId are not nodes in the graph.

Definition at line 2222 of file network.cpp.

References TStr::Fmt(), TNEANet::GetNode(), IAssertR, TNEANet::IsEdge(), and TNEANet::IsNode().

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

Here is the call graph for this function:

int TDirNet::AddEdge ( const TEdgeI & EdgeI )

inline

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

Definition at line 3465 of file network.h.

References AddEdge(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

Referenced by AddEdge().

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

TDirNet::AddEdge

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

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

Definition: network.cpp:2222

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::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 2142 of file network.cpp.

References THash< TKey, TDat, THashFunc >::AddDat(), TStr::Fmt(), IAssertR, TNEANet::IsNode(), TMath::Mx(), TNEANet::MxNId, and TNEANet::NodeH.

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

int TDirNet::AddNode ( const TNodeI & NodeId )

inline

Adds a node of ID NodeI.GetId() to the network.

Definition at line 3411 of file network.h.

References AddNode(), and TDirNet::TNodeI::GetId().

Referenced by AddNode().

3411 { return AddNode(NodeId.GetId()); }

TDirNet::AddNode

int AddNode(int NId=-1)

Adds a node of ID NId to the network.

Definition: network.cpp:2142

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::AddNode	(	const int &	NId,
		const TIntV &	InNIdV,
		const TIntV &	OutNIdV
	)

Adds a node of ID NId to the network, creates edges to the node from all nodes in vector InNIdV, creates edges from the node to all nodes in vector OutNIdV.

//OutNIdV) 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.

The operation can create inconsistent graphs when the neighboring nodes in vectors InNIdV and OutNIdV do not exist. Use TDirNet::IsOk to check that the resulting graph is consistent after the operation.

Definition at line 2155 of file network.cpp.

References THash< TKey, TDat, THashFunc >::AddDat(), TStr::Fmt(), IAssertR, TDirNet::TNode::Id, TDirNet::TNode::InNIdV, TNEANet::IsNode(), TMath::Mx(), TNEANet::MxNId, TNEANet::NodeH, TDirNet::TNode::OutNIdV, and TVec< TVal, TSizeTy >::Sort().

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

Here is the call graph for this function:

int TDirNet::AddNode	(	const int &	NId,
		const TVecPool< TInt > &	Pool,
		const int &	SrcVId,
		const int &	DstVId
	)

Adds a node of ID NId to the network, creates edges to the node from all nodes in vector InNIdV in the vector pool Pool, creates edges from the node to all nodes in vector OutNIdVin the vector pool Pool .

//NIdVId) 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.

The operation can create inconsistent graphs when the neighboring nodes stored in the Pool vector are not explicitly added to the graph. Use TDirNet::IsOk to check that the resulting graph is consistent.

Definition at line 2175 of file network.cpp.

References THash< TKey, TDat, THashFunc >::AddDat(), TStr::Fmt(), TVec< TVal, TSizeTy >::GenExt(), TVecPool< TVal, TSizeTy >::GetValVPt(), TVecPool< TVal, TSizeTy >::GetVLen(), IAssertR, TDirNet::TNode::Id, TDirNet::TNode::InNIdV, TNEANet::IsNode(), TMath::Mx(), TNEANet::MxNId, TNEANet::NodeH, TDirNet::TNode::OutNIdV, and TVec< TVal, TSizeTy >::Sort().

                                                                                                      {
   int NewNId;
   if (NId == -1) {
     NewNId = MxNId;  MxNId++;
   } else {
     IAssertR(!IsNode(NId), TStr::Fmt("NodeId %d already exists", NId));
     NewNId = NId;
     MxNId = TMath::Mx(NewNId+1, MxNId());
   }
   TNode& Node = NodeH.AddDat(NewNId);
   Node.Id = NewNId;
   Node.InNIdV.GenExt(Pool.GetValVPt(SrcVId), Pool.GetVLen(SrcVId));
   Node.OutNIdV.GenExt(Pool.GetValVPt(DstVId), Pool.GetVLen(DstVId));
   Node.InNIdV.Sort();
   Node.OutNIdV.Sort();
   return NewNId;
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName,
		const TInt &	Val
	)

Adds Int sparse attribute with name AttrName to the given edge with ids SrcId and DstId.

Definition at line 2476 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

Referenced by AddSAttrDatE().

                                                                                                      {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.AddSAttrDat(EId, AttrName, Val);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::AddSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId,
		const TInt &	Val
	)

Adds Int sparse attribute with id AttrId to the given edge with ids SrcId and DstId.

Definition at line 2484 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                    {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.AddSAttrDat(EId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName,
		const TInt &	Val
	)

inline

Adds Int sparse attribute with name AttrName to EdgeI.

Definition at line 3645 of file network.h.

References AddSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                {
     return AddSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId,
		const TInt &	Val
	)

inline

Adds Int sparse attribute with id AttrId to EdgeI.

Definition at line 3649 of file network.h.

References AddSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                                              {
     return AddSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName,
		const TFlt &	Val
	)

Adds Flt sparse attribute with name AttrName to the given edge with ids SrcId and DstId.

Definition at line 2492 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                      {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.AddSAttrDat(EId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId,
		const TFlt &	Val
	)

Adds Flt sparse attribute with id AttrId to the given edge with ids SrcId and DstId.

Definition at line 2500 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                    {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.AddSAttrDat(EId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName,
		const TFlt &	Val
	)

inline

Adds Flt sparse attribute with name AttrName to EdgeI.

Definition at line 3659 of file network.h.

References AddSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                {
     return AddSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId,
		const TFlt &	Val
	)

inline

Adds Flt sparse attribute with id AttrId to EdgeI.

Definition at line 3663 of file network.h.

References AddSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                                             {
     return AddSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName,
		const TStr &	Val
	)

Adds Str sparse attribute with name AttrName to the given edge with ids SrcId and DstId.

Definition at line 2508 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                      {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.AddSAttrDat(EId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId,
		const TStr &	Val
	)

Adds Str sparse attribute with id AttrId to the given edge with ids SrcId and DstId.

Definition at line 2516 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                    {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.AddSAttrDat(EId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName,
		const TStr &	Val
	)

inline

Adds Str sparse attribute with name AttrName to EdgeI.

Definition at line 3673 of file network.h.

References AddSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                {
     return AddSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId,
		const TStr &	Val
	)

inline

Adds Str sparse attribute with id AttrId to EdgeI.

Definition at line 3677 of file network.h.

References AddSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                                              {
     return AddSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName,
		const TInt &	Val
	)

Adds Int sparse attribute with name AttrName to the given node with id NId.

Definition at line 2350 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

Referenced by AddSAttrDatN().

                                                                                 {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.AddSAttrDat(NId, AttrName, Val);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::AddSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId,
		const TInt &	Val
	)

Adds Int sparse attribute with id AttrId to the given node with id NId.

Definition at line 2357 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                               {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.AddSAttrDat(NId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName,
		const TInt &	Val
	)

inline

Adds Int sparse attribute with name AttrName to NodeI.

Definition at line 3527 of file network.h.

References AddSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                                                {
     return AddSAttrDatN(NodeI.GetId(), AttrName, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId,
		const TInt &	Val
	)

inline

Adds Int sparse attribute with id AttrId to NodeI.

Definition at line 3531 of file network.h.

References AddSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                                              {
     return AddSAttrDatN(NodeI.GetId(), AttrId, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName,
		const TFlt &	Val
	)

Adds Flt sparse attribute with name AttrName to the given node with id NId.

Definition at line 2364 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                                 {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.AddSAttrDat(NId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId,
		const TFlt &	Val
	)

Adds Flt sparse attribute with id AttrId to the given node with id NId.

Definition at line 2371 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                               {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.AddSAttrDat(NId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName,
		const TFlt &	Val
	)

inline

Adds Flt sparse attribute with name AttrName to NodeI.

Definition at line 3541 of file network.h.

References AddSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                                                {
     return AddSAttrDatN(NodeI.GetId(), AttrName, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId,
		const TFlt &	Val
	)

inline

Adds Flt sparse attribute with id AttrId to NodeI.

Definition at line 3545 of file network.h.

References AddSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                                              {
     return AddSAttrDatN(NodeI.GetId(), AttrId, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName,
		const TStr &	Val
	)

Adds Str sparse attribute with name AttrName to the given node with id NId.

Definition at line 2378 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                                 {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.AddSAttrDat(NId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId,
		const TStr &	Val
	)

Adds Str sparse attribute with id AttrId to the given node with id NId.

Definition at line 2385 of file network.cpp.

References TAttr::AddSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                               {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.AddSAttrDat(NId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName,
		const TStr &	Val
	)

inline

Adds Str sparse attribute with name AttrName to NodeI.

Definition at line 3555 of file network.h.

References AddSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                                                {
     return AddSAttrDatN(NodeI.GetId(), AttrName, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId,
		const TStr &	Val
	)

inline

Adds Str sparse attribute with id AttrId to NodeI.

Definition at line 3559 of file network.h.

References AddSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                                              {
     return AddSAttrDatN(NodeI.GetId(), AttrId, Val);
   }

Here is the call graph for this function:

int TDirNet::AddSAttrE	(	const TStr &	Name,
		const TAttrType &	AttrType,
		TInt &	AttrId
	)

Adds mapping for sparse attribute with name Name and type AttrType.

Definition at line 2605 of file network.cpp.

References TAttr::AddSAttr(), and TNEANet::SAttrE.

                                                                                 {
   return SAttrE.AddSAttr(Name, AttrType, AttrId);
 }

Here is the call graph for this function:

int TDirNet::AddSAttrN	(	const TStr &	Name,
		const TAttrType &	AttrType,
		TInt &	AttrId
	)

Adds mapping for sparse attribute with name Name and type AttrType.

Definition at line 2464 of file network.cpp.

References TAttr::AddSAttr(), and TNEANet::SAttrN.

                                                                                 {
   return SAttrN.AddSAttr(Name, AttrType, AttrId);
 }

Here is the call graph for this function:

TEdgeI TDirNet::BegEI ( ) const

inline

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

Definition at line 3475 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::BegNI(), TNodeEdgeNet< TNodeData, TEdgeData >::EndNI(), and TDirNet::TNodeI::GetOutDeg().

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

TDirNet::BegNI

TNodeI BegNI() const

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

Definition: network.h:3444

TDirNet::EndNI

TNodeI EndNI() const

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

Definition: network.h:3446

Here is the call graph for this function:

TNodeI TDirNet::BegNI ( ) const

inline

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

Definition at line 3444 of file network.h.

References THash< TKey, TDat, THashFunc >::BegI(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3444 { return TNodeI(NodeH.BegI()); }

THash::BegI

TIter BegI() const

Definition: hash.h:171

THash< TInt, TNode > NodeH

Definition: network.h:3368

Here is the call graph for this function:

void TDirNet::Clr ( )

inline

Deletes all nodes and edges from the network.

Definition at line 3493 of file network.h.

References TAttr::Clr(), TAttrPair::Clr(), THash< TKey, TDat, THashFunc >::Clr(), TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, SAttrE, and SAttrN.

3493 { MxNId=0; NodeH.Clr(); SAttrN.Clr(); SAttrE.Clr(); }

TAttrPair SAttrE

Definition: network.h:3370

TAttr SAttrN

Definition: network.h:3369

THash< TInt, TNode > NodeH

Definition: network.h:3368

TAttrPair::Clr

void Clr()

Clears the contents of the attribute map.

Definition: attr.h:114

THash::Clr

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

Definition: hash.h:319

TInt MxNId

Definition: network.h:3367

TAttr::Clr

void Clr()

Clears the contents of the attribute map.

Definition: attr.h:29

Here is the call graph for this function:

void TDirNet::Defrag ( const bool & OnlyNodeLinks = false )

Defragments the network.

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

Definition at line 2270 of file network.cpp.

References THash< TKey, TDat, THashFunc >::Defrag(), THash< TKey, TDat, THashFunc >::FFirstKeyId(), THash< TKey, TDat, THashFunc >::FNextKeyId(), TDirNet::TNode::InNIdV, THash< TKey, TDat, THashFunc >::IsKeyIdEqKeyN(), TNEANet::NodeH, TDirNet::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:

void TDirNet::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 graph function still completes. But the function aborts if SrcNId or DstNId are not nodes in the graph.

Definition at line 2231 of file network.cpp.

References TVec< TVal, TSizeTy >::Del(), TAttr::DelSAttrId(), TStr::Fmt(), TNEANet::GetNode(), IAssertR, TDirNet::TNode::InNIdV, TNEANet::IsNode(), TDirNet::TNode::OutNIdV, TNEANet::SAttrE, and TVec< TVal, TSizeTy >::SearchBin().

                                                                              {
   IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
   { TNode& N = GetNode(SrcNId);
   TIntPr Id(SrcNId, DstNId);
   SAttrE.DelSAttrId(Id);
   const int n = N.OutNIdV.SearchBin(DstNId);
   if (n!= -1) { N.OutNIdV.Del(n); } }
   { TNode& N = GetNode(DstNId);
   const int n = N.InNIdV.SearchBin(SrcNId);
   if (n!= -1) { N.InNIdV.Del(n); } }
   if (! IsDir) {
     { TNode& N = GetNode(SrcNId);
     const int n = N.InNIdV.SearchBin(DstNId);
     if (n!= -1) { N.InNIdV.Del(n); } }
     { TNode& N = GetNode(DstNId);
     const int n = N.OutNIdV.SearchBin(SrcNId);
     if (n!= -1) { N.OutNIdV.Del(n); } }
   }
 }

Here is the call graph for this function:

void TDirNet::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 2193 of file network.cpp.

References TVec< TVal, TSizeTy >::Del(), THash< TKey, TDat, THashFunc >::DelKey(), TAttr::DelSAttrId(), TDirNet::TNode::GetInDeg(), TDirNet::TNode::GetInNId(), TNEANet::GetNode(), TDirNet::TNode::GetOutDeg(), TDirNet::TNode::GetOutNId(), TDirNet::TNode::InNIdV, TNEANet::NodeH, TDirNet::TNode::OutNIdV, TNEANet::SAttrN, and TVec< TVal, TSizeTy >::SearchBin().

                                     {
   { TNode& Node = GetNode(NId);
   TInt Id(NId);
   SAttrN.DelSAttrId(Id);
   for (int e = 0; e < Node.GetOutDeg(); e++) {
   const int nbr = Node.GetOutNId(e);
   if (nbr == NId) { continue; }
     TNode& N = GetNode(nbr);
     const 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);
     const int n = N.OutNIdV.SearchBin(NId);
     if (n!= -1) { N.OutNIdV.Del(n); }
   } }
   NodeH.DelKey(NId);
 }

Here is the call graph for this function:

void TDirNet::DelNode ( const TNode & NodeI )

inline

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

Definition at line 3440 of file network.h.

References DelNode(), and TDirNet::TNode::GetId().

Referenced by DelNode().

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

TDirNet::DelNode

void DelNode(const int &NId)

Deletes node of ID NId from the network.

Definition: network.cpp:2193

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::DelSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName
	)

Deletes sparse attribute with name AttrName from edge with ids SrcId and DstId.

Definition at line 2572 of file network.cpp.

References TAttr::DelSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

Referenced by DelSAttrDatE().

                                                                                     {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.DelSAttrDat(EId, AttrName);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::DelSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId
	)

Deletes sparse attribute with id AttrId from edge with ids SrcId and DstId.

Definition at line 2580 of file network.cpp.

References TAttr::DelSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                   {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.DelSAttrDat(EId, AttrId);
 }

Here is the call graph for this function:

int TDirNet::DelSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName
	)

inline

Deletes sparse attribute with name AttrName from EdgeI.

Definition at line 3729 of file network.h.

References DelSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                               {
     return DelSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName);
   }

Here is the call graph for this function:

int TDirNet::DelSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId
	)

inline

Deletes sparse attribute with id AttrId from EdgeI.

Definition at line 3733 of file network.h.

References DelSAttrDatE(), TDirNet::TEdgeI::GetDstNId(), and TDirNet::TEdgeI::GetSrcNId().

                                                             {
     return DelSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId);
   } 

Here is the call graph for this function:

int TDirNet::DelSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName
	)

Deletes sparse attribute with name AttrName from node with id NId.

Definition at line 2434 of file network.cpp.

References TAttr::DelSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

Referenced by DelSAttrDatN().

                                                                {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.DelSAttrDat(NId, AttrName);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::DelSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId
	)

Deletes sparse attribute with id AttrId from node with id NId.

Definition at line 2441 of file network.cpp.

References TAttr::DelSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                              {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.DelSAttrDat(NId, AttrId);
 }

Here is the call graph for this function:

int TDirNet::DelSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName
	)

inline

Deletes sparse attribute with name AttrName from NodeI.

Definition at line 3611 of file network.h.

References DelSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                               {
     return DelSAttrDatN(NodeI.GetId(), AttrName);
   }

Here is the call graph for this function:

int TDirNet::DelSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId
	)

inline

Deletes sparse attribute with id AttrId from NodeI.

Definition at line 3615 of file network.h.

References DelSAttrDatN(), and TDirNet::TNodeI::GetId().

                                                             {
     return DelSAttrDatN(NodeI.GetId(), AttrId);
   }

Here is the call graph for this function:

void TDirNet::Dump ( FILE * OutF = stdout ) const

Print the network in a human readable form to an output stream OutF.

Definition at line 2325 of file network.cpp.

References edge, THash< TKey, TDat, THashFunc >::FFirstKeyId(), THash< TKey, TDat, THashFunc >::FNextKeyId(), TNEANet::GetEdges(), TDirNet::TNode::GetId(), TDirNet::TNode::GetInDeg(), TDirNet::TNode::GetInNId(), TNEANet::GetNodes(), TDirNet::TNode::GetOutDeg(), TDirNet::TNode::GetOutNId(), and TNEANet::NodeH.

                                    {
   const int NodePlaces = (int) ceil(log10((double) GetNodes()));
   fprintf(OutF, "-------------------------------------------------\nDirected Node Graph: nodes: %d, edges: %d\n", GetNodes(), GetEdges());
   for (int N = NodeH.FFirstKeyId(); NodeH.FNextKeyId(N); ) {
     const TNode& Node = NodeH[N];
     fprintf(OutF, "  %*d]\n", NodePlaces, Node.GetId());
     fprintf(OutF, "    in [%d]", Node.GetInDeg());
     for (int edge = 0; edge < Node.GetInDeg(); edge++) {
       fprintf(OutF, " %*d", NodePlaces, Node.GetInNId(edge)); }
     fprintf(OutF, "\n    out[%d]", Node.GetOutDeg());
     for (int edge = 0; edge < Node.GetOutDeg(); edge++) {
       fprintf(OutF, " %*d", NodePlaces, Node.GetOutNId(edge)); }
     fprintf(OutF, "\n");
   }
   fprintf(OutF, "\n");
 }

Here is the call graph for this function:

bool TDirNet::Empty ( ) const

inline

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

Definition at line 3491 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::GetNodes().

3491 { return GetNodes()==0; }

TDirNet::GetNodes

int GetNodes() const

Returns the number of nodes in the network.

Definition: network.h:3403

Here is the call graph for this function:

TEdgeI TDirNet::EndEI ( ) const

inline

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

Definition at line 3477 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::EndNI().

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

TDirNet::EndNI

TNodeI EndNI() const

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

Definition: network.h:3446

Here is the call graph for this function:

TNodeI TDirNet::EndNI ( ) const

inline

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

Definition at line 3446 of file network.h.

References THash< TKey, TDat, THashFunc >::EndI(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3446 { return TNodeI(NodeH.EndI()); }

THash::EndI

TIter EndI() const

Definition: hash.h:176

THash< TInt, TNode > NodeH

Definition: network.h:3368

Here is the call graph for this function:

int TDirNet::GetEdges ( ) const

Returns the number of edges in the network.

Definition at line 2214 of file network.cpp.

References THash< TKey, TDat, THashFunc >::FFirstKeyId(), THash< TKey, TDat, THashFunc >::FNextKeyId(), and TNEANet::NodeH.

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

Here is the call graph for this function:

TEdgeI TDirNet::GetEI ( const int & EId ) const

Not supported/implemented!

TDirNet::TEdgeI TDirNet::GetEI	(	const int &	SrcNId,
		const int &	DstNId
	)		const

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

Definition at line 2257 of file network.cpp.

References TNEANet::EndNI(), TNEANet::GetNI(), IAssert, and TDirNet::TNodeI::NodeHI.

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

Here is the call graph for this function:

int TDirNet::GetIdVSAttrE	(	const TStr &	AttrName,
		TIntPrV &	IdV
	)		const

Gets a list of all edges that have a sparse attribute with name AttrName.

Definition at line 2597 of file network.cpp.

References TAttr::GetIdVSAttr(), and TNEANet::SAttrE.

                                                                   {
   return SAttrE.GetIdVSAttr(AttrName, IdV);
 }

Here is the call graph for this function:

int TDirNet::GetIdVSAttrE	(	const TInt &	AttrId,
		TIntPrV &	IdV
	)		const

Gets a list of all edges that have a sparse attribute with id AttrId.

Definition at line 2601 of file network.cpp.

References TAttr::GetIdVSAttr(), and TNEANet::SAttrE.

                                                                 {
   return SAttrE.GetIdVSAttr(AttrId, IdV);
 }

Here is the call graph for this function:

int TDirNet::GetIdVSAttrN	(	const TStr &	AttrName,
		TIntV &	IdV
	)		const

Gets a list of all nodes that have a sparse attribute with name AttrName.

Definition at line 2456 of file network.cpp.

References TAttr::GetIdVSAttr(), and TNEANet::SAttrN.

                                                                 {
   return SAttrN.GetIdVSAttr(AttrName, IdV);
 }

Here is the call graph for this function:

int TDirNet::GetIdVSAttrN	(	const TInt &	AttrId,
		TIntV &	IdV
	)		const

Gets a list of all nodes that have a sparse attribute with id AttrId.

Definition at line 2460 of file network.cpp.

References TAttr::GetIdVSAttr(), and TNEANet::SAttrN.

                                                               {
   return SAttrN.GetIdVSAttr(AttrId, IdV);
 }

Here is the call graph for this function:

int TDirNet::GetMxNId ( ) const

inline

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

Definition at line 3452 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId.

3452 { return MxNId; }

TInt MxNId

Definition: network.h:3367

TNodeI TDirNet::GetNI ( const int & NId ) const

inline

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

Definition at line 3448 of file network.h.

References THash< TKey, TDat, THashFunc >::GetI(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3448 { return TNodeI(NodeH.GetI(NId)); }

THash< TInt, TNode > NodeH

Definition: network.h:3368

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:178

Here is the call graph for this function:

void TDirNet::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the network.

Definition at line 2264 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), THash< TKey, TDat, THashFunc >::FFirstKeyId(), THash< TKey, TDat, THashFunc >::FNextKeyId(), TVec< TVal, TSizeTy >::Gen(), THash< TKey, TDat, THashFunc >::GetKey(), TNEANet::GetNodes(), and TNEANet::NodeH.

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

Here is the call graph for this function:

TNode& TDirNet::GetNode ( const int & NId )

inlineprivate

Definition at line 3372 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3372 { return NodeH.GetDat(NId); }

THash::GetDat

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TNode > NodeH

Definition: network.h:3368

Here is the call graph for this function:

const TNode& TDirNet::GetNode ( const int & NId ) const

inlineprivate

Definition at line 3373 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3373 { return NodeH.GetDat(NId); }

THash::GetDat

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TNode > NodeH

Definition: network.h:3368

Here is the call graph for this function:

int TDirNet::GetNodes ( ) const

inline

Returns the number of nodes in the network.

Definition at line 3403 of file network.h.

References THash< TKey, TDat, THashFunc >::Len(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3403 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:3368

THash::Len

int Len() const

Definition: hash.h:186

Here is the call graph for this function:

TNodeI TDirNet::GetRndNI ( TRnd & Rnd = TInt::Rnd )

inline

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

Definition at line 3486 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::GetNI(), and TNodeEdgeNet< TNodeData, TEdgeData >::GetRndNId().

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

TDirNet::GetNI

TNodeI GetNI(const int &NId) const

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

Definition: network.h:3448

TDirNet::GetRndNId

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

Returns an ID of a random node in the network.

Definition: network.h:3484

Here is the call graph for this function:

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

inline

Returns an ID of a random node in the network.

Definition at line 3484 of file network.h.

References THash< TKey, TDat, THashFunc >::GetKey(), THash< TKey, TDat, THashFunc >::GetRndKeyId(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

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

THash< TInt, TNode > NodeH

Definition: network.h:3368

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

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:210

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName,
		TInt &	ValX
	)		const

Gets Int sparse attribute with name AttrName from edge with ids SrcId and DstId.

Definition at line 2524 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

Referenced by GetSAttrDatE().

                                                                                                      {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.GetSAttrDat(EId, AttrName, Val);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::GetSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId,
		TInt &	ValX
	)		const

Gets Int sparse attribute with id AttrId from edge with ids SrcId and DstId.

Definition at line 2532 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                    {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.GetSAttrDat(EId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName,
		TInt &	ValX
	)		const

inline

Gets Int sparse attribute with name AttrName from EdgeI.

Definition at line 3687 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrDatE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                 {
     return GetSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId,
		TInt &	ValX
	)		const

inline

Gets Int sparse attribute with id AttrId from EdgeI.

Definition at line 3691 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrDatE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                               {
     return GetSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId, ValX);
   } 

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName,
		TFlt &	ValX
	)		const

Gets Flt sparse attribute with name AttrName from edge with ids SrcId and DstId.

Definition at line 2540 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                      {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.GetSAttrDat(EId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId,
		TFlt &	ValX
	)		const

Gets Flt sparse attribute with id AttrId from edge with ids SrcId and DstId.

Definition at line 2548 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                    {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.GetSAttrDat(EId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName,
		TFlt &	ValX
	)		const

inline

Gets Flt sparse attribute with name AttrName from EdgeI.

Definition at line 3701 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrDatE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                 {
     return GetSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId,
		TFlt &	ValX
	)		const

inline

Gets Flt sparse attribute with id AttrId from EdgeI.

Definition at line 3705 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrDatE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                               {
     return GetSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId, ValX);
   } 

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TStr &	AttrName,
		TStr &	ValX
	)		const

Gets Str sparse attribute with name AttrName from edge with ids SrcId and DstId.

Definition at line 2556 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                      {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.GetSAttrDat(EId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const int &	SrcNId,
		const int &	DstNId,
		const TInt &	AttrId,
		TStr &	ValX
	)		const

Gets Str sparse attribute with id AttrId from edge with ids SrcId and DstId.

Definition at line 2564 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsEdge(), and TNEANet::SAttrE.

                                                                                                    {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   return SAttrE.GetSAttrDat(EId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	AttrName,
		TStr &	ValX
	)		const

inline

Gets Str sparse attribute with name AttrName from EdgeI.

Definition at line 3715 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrDatE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                 {
     return GetSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrName, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatE	(	const TEdgeI &	EdgeI,
		const TInt &	AttrId,
		TStr &	ValX
	)		const

inline

Gets Str sparse attribute with id AttrId from EdgeI.

Definition at line 3719 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrDatE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                               {
     return GetSAttrDatE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrId, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName,
		TInt &	ValX
	)		const

Gets Int sparse attribute with name AttrName from node with id NId.

Definition at line 2392 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

Referenced by GetSAttrDatN().

                                                                                 {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.GetSAttrDat(NId, AttrName, Val);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::GetSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId,
		TInt &	ValX
	)		const

Gets Int sparse attribute with id AttrId from node with id NId.

Definition at line 2399 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                               {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.GetSAttrDat(NId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName,
		TInt &	ValX
	)		const

inline

Gets Int sparse attribute with name AttrName from NodeI.

Definition at line 3569 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrDatN().

                                                                                 {
     return GetSAttrDatN(NodeI.GetId(), AttrName, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId,
		TInt &	ValX
	)		const

inline

Gets Int sparse attribute with id AttrId from NodeI.

Definition at line 3573 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrDatN().

                                                                               {
     return GetSAttrDatN(NodeI.GetId(), AttrId, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName,
		TFlt &	ValX
	)		const

Gets Flt sparse attribute with name AttrName from node with id NId.

Definition at line 2406 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                                 {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.GetSAttrDat(NId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId,
		TFlt &	ValX
	)		const

Gets Flt sparse attribute with id AttrId from node with id NId.

Definition at line 2413 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                               {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.GetSAttrDat(NId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName,
		TFlt &	ValX
	)		const

inline

Gets Flt sparse attribute with name AttrName from NodeI.

Definition at line 3583 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrDatN().

                                                                                 {
     return GetSAttrDatN(NodeI.GetId(), AttrName, ValX);
   } 

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId,
		TFlt &	ValX
	)		const

inline

Gets Flt sparse attribute with id AttrId from NodeI.

Definition at line 3587 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrDatN().

                                                                               {
     return GetSAttrDatN(NodeI.GetId(), AttrId, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TInt &	NId,
		const TStr &	AttrName,
		TStr &	ValX
	)		const

Gets Str sparse attribute with name AttrName from node with id NId.

Definition at line 2420 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                                 {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.GetSAttrDat(NId, AttrName, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TInt &	NId,
		const TInt &	AttrId,
		TStr &	ValX
	)		const

Gets Str sparse attribute with id AttrId from node with id NId.

Definition at line 2427 of file network.cpp.

References TAttr::GetSAttrDat(), TNEANet::IsNode(), and TNEANet::SAttrN.

                                                                               {
   if (!IsNode(NId)) {
     return -1;
   }
   return SAttrN.GetSAttrDat(NId, AttrId, Val);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	AttrName,
		TStr &	ValX
	)		const

inline

Gets Str sparse attribute with name AttrName from NodeI.

Definition at line 3597 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrDatN().

                                                                                 {
     return GetSAttrDatN(NodeI.GetId(), AttrName, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	AttrId,
		TStr &	ValX
	)		const

inline

Gets Str sparse attribute with id AttrId from NodeI.

Definition at line 3601 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrDatN().

                                                                               {
     return GetSAttrDatN(NodeI.GetId(), AttrId, ValX);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrIdE	(	const TStr &	Name,
		TInt &	AttrIdX,
		TAttrType &	AttrTypeX
	)		const

Gets id and type for attribute with name Name.

Definition at line 2609 of file network.cpp.

References TAttr::GetSAttrId(), and TNEANet::SAttrE.

                                                                                   {
   return SAttrE.GetSAttrId(Name, AttrId, AttrType);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrIdN	(	const TStr &	Name,
		TInt &	AttrIdX,
		TAttrType &	AttrTypeX
	)		const

Gets id and type for attribute with name Name.

Definition at line 2468 of file network.cpp.

References TAttr::GetSAttrId(), and TNEANet::SAttrN.

                                                                                   {
   return SAttrN.GetSAttrId(Name, AttrId, AttrType);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrNameE	(	const TInt &	AttrId,
		TStr &	NameX,
		TAttrType &	AttrTypeX
	)		const

Gets name and type for attribute with id AttrId.

Definition at line 2613 of file network.cpp.

References TAttr::GetSAttrName(), and TNEANet::SAttrE.

2613 {

2614 return SAttrE.GetSAttrName(AttrId, Name, AttrType);

2615 }

TAttrPair SAttrE

Definition: network.h:3370

TAttrPair::GetSAttrName

int GetSAttrName(const TInt &AttrId, TStr &NameX, TAttrType &AttrTypeX) const

Given the attribute id AttrId, get the attribute name and type.

Definition: attr.cpp:477

Here is the call graph for this function:

int TDirNet::GetSAttrNameN	(	const TInt &	AttrId,
		TStr &	NameX,
		TAttrType &	AttrTypeX
	)		const

Gets name and type for attribute with id AttrId.

Definition at line 2472 of file network.cpp.

References TAttr::GetSAttrName(), and TNEANet::SAttrN.

                                                                                     {
   return SAttrN.GetSAttrName(AttrId, Name, AttrType);
 }

Here is the call graph for this function:

int TDirNet::GetSAttrVE	(	const int &	SrcNId,
		const int &	DstNId,
		const TAttrType	AttrType,
		TAttrPrV &	AttrV
	)		const

Gets a list of all sparse attributes of type AttrType for edge with ids SrcId and DstId.

Definition at line 2588 of file network.cpp.

References TAttr::GetSAttrV(), TNEANet::IsEdge(), and TNEANet::SAttrE.

Referenced by GetSAttrVE().

                                                                                                              {
   if (!IsEdge(SrcNId, DstNId)) {
     return -1;
   }
   TIntPr EId(SrcNId, DstNId);
   SAttrE.GetSAttrV(EId, AttrType, AttrV);
   return 0;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::GetSAttrVE	(	const TEdgeI &	EdgeI,
		const TAttrType	AttrType,
		TAttrPrV &	AttrV
	)		const

inline

Gets a list of all sparse attributes of type AttrType for EdgeI.

Definition at line 3739 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), GetSAttrVE(), and TDirNet::TEdgeI::GetSrcNId().

                                                                                        {
     return GetSAttrVE(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), AttrType, AttrV);
   }

Here is the call graph for this function:

int TDirNet::GetSAttrVN	(	const TInt &	NId,
		const TAttrType	AttrType,
		TAttrPrV &	AttrV
	)		const

Gets a list of all sparse attributes of type AttrType for node with id NId.

Definition at line 2448 of file network.cpp.

References TAttr::GetSAttrV(), TNEANet::IsNode(), and TNEANet::SAttrN.

Referenced by GetSAttrVN().

                                                                                         {
   if (!IsNode(NId)) {
     return -1;
   }
   SAttrN.GetSAttrV(NId, AttrType, AttrV);
   return 0;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TDirNet::GetSAttrVN	(	const TNodeI &	NodeI,
		const TAttrType	AttrType,
		TAttrPrV &	AttrV
	)		const

inline

Gets a list of all sparse attributes of type AttrType for NodeI.

Definition at line 3622 of file network.h.

References TDirNet::TNodeI::GetId(), and GetSAttrVN().

                                                                                        {
     return GetSAttrVN(NodeI.GetId(), AttrType, AttrV);
   }

Here is the call graph for this function:

PDirNet TDirNet::GetSmallGraph ( )

static

Returns a small network on 5 nodes and 6 edges.

/// Edges:  0 -> 1, 1 -> 2, 0 -> 2, 1 -> 3, 3 -> 4, 2 -> 3
///

Definition at line 2342 of file network.cpp.

References New().

                                {
   PDirNet G = TDirNet::New();
   for (int i = 0; i < 5; i++) { G->AddNode(i); }
   G->AddEdge(0,1); G->AddEdge(1,2); G->AddEdge(0,2);
   G->AddEdge(1,3); G->AddEdge(3,4); G->AddEdge(2,3);
   return G;
 }

Here is the call graph for this function:

bool TDirNet::HasFlag ( const TGraphFlag & Flag ) const

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

Definition at line 2138 of file network.cpp.

References HasGraphFlag.

                                                   {
   return HasGraphFlag(TDirNet::TNet, Flag);
 }

bool TDirNet::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 2251 of file network.cpp.

References TNEANet::GetNode(), and TNEANet::IsNode().

                                                                                   {
   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 call graph for this function:

bool TDirNet::IsNode ( const int & NId ) const

inline

Tests whether ID NId is a node.

Definition at line 3442 of file network.h.

References THash< TKey, TDat, THashFunc >::IsKey(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

3442 { return NodeH.IsKey(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:3368

THash::IsKey

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

bool TDirNet::IsOk ( const bool & ThrowExcept = true ) const

Checks the network data structure for internal consistency.

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

Definition at line 2279 of file network.cpp.

References TStr::CStr(), EAssertR, ErrNotify(), THash< TKey, TDat, THashFunc >::FFirstKeyId(), TStr::Fmt(), THash< TKey, TDat, THashFunc >::FNextKeyId(), TDirNet::TNode::GetId(), TDirNet::TNode::GetInDeg(), TDirNet::TNode::GetInNId(), TDirNet::TNode::GetOutDeg(), TDirNet::TNode::GetOutNId(), TDirNet::TNode::InNIdV, TNEANet::IsNode(), TVec< TVal, TSizeTy >::IsSorted(), TNEANet::NodeH, and TDirNet::TNode::OutNIdV.

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

static PDirNet TDirNet::Load ( TSIn & SIn )

inlinestatic

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

Definition at line 3392 of file network.h.

References TDirNet().

3392 { return PDirNet(new TDirNet(SIn)); }

TDirNet::TDirNet

TDirNet()

Definition: network.h:3375

PDirNet

TPt< TDirNet > PDirNet

Pointer to a directed network (TDirNet)

Definition: network.h:2730

Here is the call graph for this function:

static PDirNet TDirNet::Load_V1 ( TSIn & SIn )

inlinestatic

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

Definition at line 3394 of file network.h.

References TDirNet().

                                     { PDirNet Graph = PDirNet(new TDirNet());
     Graph->MxNId.Load(SIn); Graph->NodeH.Load(SIn); return Graph;
   }

Here is the call graph for this function:

static PDirNet TDirNet::New ( )

inlinestatic

Static constructor that returns a pointer to the network. Call: PDirNet Graph = TDirNet::New().

Definition at line 3386 of file network.h.

References TDirNet().

Referenced by GetSmallGraph().

3386 { return new TDirNet(); }

TDirNet::TDirNet

TDirNet()

Definition: network.h:3375

Here is the call graph for this function:

Here is the caller graph for this function:

static PDirNet TDirNet::New	(	const int &	Nodes,
		const int &	Edges
	)

inlinestatic

Static constructor that returns a pointer to the network and reserves enough memory for Nodes nodes and Edges edges.

Call: PDirNet Net = TDirNet::New(Nodes, Edges).

Definition at line 3390 of file network.h.

References TDirNet().

3390 { return new TDirNet(Nodes, Edges); }

TDirNet::TDirNet

TDirNet()

Definition: network.h:3375

Here is the call graph for this function:

TDirNet& TDirNet::operator= ( const TDirNet & Graph )

inline

Definition at line 3399 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, MxNId, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, and NodeH.

3399 {

3400 if (this!=&Graph) { MxNId=Graph.MxNId; NodeH=Graph.NodeH; } return *this; }

THash< TInt, TNode > NodeH

Definition: network.h:3368

TInt MxNId

Definition: network.h:3367

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

inline

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

Definition at line 3495 of file network.h.

References THash< TKey, TDat, THashFunc >::Gen(), and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

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

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:180

THash< TInt, TNode > NodeH

Definition: network.h:3368

Here is the call graph for this function:

void TDirNet::ReserveNIdInDeg	(	const int &	NId,
		const int &	InDeg
	)

inline

Reserves memory for node ID NId having InDeg in-edges.

Definition at line 3497 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::GetNode().

3497 { GetNode(NId).InNIdV.Reserve(InDeg); }

TDirNet::GetNode

TNode & GetNode(const int &NId)

Definition: network.h:3372

TDirNet::TNode::InNIdV

TIntV InNIdV

Definition: network.h:3275

TVec::Reserve

void Reserve(const TSizeTy &_MxVals)

Reserves enough memory for the vector to store _MxVals elements.

Definition: ds.h:515

Here is the call graph for this function:

void TDirNet::ReserveNIdOutDeg	(	const int &	NId,
		const int &	OutDeg
	)

inline

Reserves memory for node ID NId having OutDeg out-edges.

Definition at line 3499 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::GetNode().

3499 { GetNode(NId).OutNIdV.Reserve(OutDeg); }

TDirNet::GetNode

TNode & GetNode(const int &NId)

Definition: network.h:3372

TDirNet::TNode::OutNIdV

TIntV OutNIdV

Definition: network.h:3275

TVec::Reserve

void Reserve(const TSizeTy &_MxVals)

Reserves enough memory for the vector to store _MxVals elements.

Definition: ds.h:515

Here is the call graph for this function:

void TDirNet::Save ( TSOut & SOut ) const

inline

Saves the network to a (binary) stream SOut. Expects data structures for sparse attributes.

Definition at line 3382 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, SAttrE, SAttrN, TAttr::Save(), TAttrPair::Save(), THash< TKey, TDat, THashFunc >::Save(), and TInt::Save().

3382 { MxNId.Save(SOut); NodeH.Save(SOut); SAttrN.Save(SOut); SAttrE.Save(SOut); }

TInt::Save

void Save(TSOut &SOut) const

Definition: dt.h:1060

TAttrPair SAttrE

Definition: network.h:3370

THash::Save

void Save(TSOut &SOut) const

Definition: hash.h:141

TAttr SAttrN

Definition: network.h:3369

TAttrPair::Save

void Save(TSOut &SOut) const

Saves the attributes to a (binary) stream SOut.

Definition: attr.h:110

THash< TInt, TNode > NodeH

Definition: network.h:3368

TAttr::Save

void Save(TSOut &SOut) const

Saves the attributes to a (binary) stream SOut.

Definition: attr.h:25

TInt MxNId

Definition: network.h:3367

Here is the call graph for this function:

void TDirNet::Save_V1 ( TSOut & SOut ) const

inline

Saves the network to a (binary) stream SOut. Available for backwards compatibility.

Definition at line 3384 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, THash< TKey, TDat, THashFunc >::Save(), and TInt::Save().

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

TInt::Save

void Save(TSOut &SOut) const

Definition: dt.h:1060

THash::Save

void Save(TSOut &SOut) const

Definition: hash.h:141

THash< TInt, TNode > NodeH

Definition: network.h:3368