SNAP Library 6.0, Developer Reference: TDirNet Class Reference

TAttrPair SAttrE

Definition: network.h:4077

TAttr SAttrN

Definition: network.h:4076

THash< TInt, TNode > NodeH

Definition: network.h:4075

TInt MxNId

Definition: network.h:4074

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 4098 of file network.h.

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

4098 : 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:4241

TAttrPair SAttrE

Definition: network.h:4077

TAttr SAttrN

Definition: network.h:4076

TInt MxNId

Definition: network.h:4074

Here is the call graph for this function:

TDirNet::TDirNet ( const TDirNet & Graph )

inline

Definition at line 4099 of file network.h.

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

TAttrPair SAttrE

Definition: network.h:4077

TAttr SAttrN

Definition: network.h:4076

THash< TInt, TNode > NodeH

Definition: network.h:4075

TInt MxNId

Definition: network.h:4074

TDirNet::TDirNet ( TSIn & SIn )

inline

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

Definition at line 4101 of file network.h.

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

TAttrPair SAttrE

Definition: network.h:4077

TAttr SAttrN

Definition: network.h:4076

THash< TInt, TNode > NodeH

Definition: network.h:4075

TDirNet::TNodeI::GetOutDeg

TInt MxNId

Definition: network.h:4074

Member Function Documentation

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

Definition at line 2713 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; // no edge id
 }

Here is the call graph for this function:

int TDirNet::AddEdge ( const TEdgeI & EdgeI )

inline

Definition at line 4211 of file network.h.

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

Referenced by AddEdge().

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

TDirNet::AddEdge

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

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

Definition: network.cpp:2713

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Returns -1. The method assumes that SrcNId and DstNId are existing nodes in the graph and adds new neighbor values at the end of their adjacency vectors. No checks are performed to verify these assumptions. Adjacency vectors must be sorted and have duplicates removed after a sequence of these operations to assure consistency of data structures.

Definition at line 2722 of file network.cpp.

References TNEANet::GetNode().

                                                                   {
   GetNode(SrcNId).OutNIdV.Add(DstNId);
   GetNode(DstNId).InNIdV.Add(SrcNId);
   return -1; // no edge id
 }

Here is the call 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 2622 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 4148 of file network.h.

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

Referenced by AddNode().

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

TDirNet::AddNode

int AddNode(int NId=-1)

Adds a node of ID NId to the network.

Definition: network.cpp:2622

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 2646 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 2666 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::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 2633 of file network.cpp.

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

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

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 2973 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 TInt &	Val
	)

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

Definition at line 2981 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 4393 of file network.h.

References 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 4397 of file network.h.

References 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 2989 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 2997 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 4407 of file network.h.

References 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 4411 of file network.h.

References 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 3005 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 3013 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 4421 of file network.h.

References 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 4425 of file network.h.

References 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 2847 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 TInt &	Val
	)

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

Definition at line 2854 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 4275 of file network.h.

References 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 4279 of file network.h.

References 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 2861 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 2868 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 4289 of file network.h.

References 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 4293 of file network.h.

References 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 2875 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 2882 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 4303 of file network.h.

References 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 4307 of file network.h.

References 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 3102 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 2961 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 4221 of file network.h.

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

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

TDirNet::BegNI

TNodeI BegNI() const

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

Definition: network.h:4181

TDirNet::EndNI

TNodeI EndNI() const

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

Definition: network.h:4183

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 4181 of file network.h.

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

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

THash::BegI

TIter BegI() const

Definition: hash.h:213

THash< TInt, TNode > NodeH

Definition: network.h:4075

Here is the call graph for this function:

void TDirNet::Clr ( )

inline

Deletes all nodes and edges from the network.

Definition at line 4239 of file network.h.

References TAttr::Clr(), TAttrPair::Clr(), and THash< TKey, TDat, THashFunc >::Clr().

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

TAttrPair SAttrE

Definition: network.h:4077

TAttr SAttrN

Definition: network.h:4076

THash< TInt, TNode > NodeH

Definition: network.h:4075

TAttrPair::Clr

void Clr()

Clears the contents of the attribute map.

Definition: attr.h:122

THash::Clr

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

Definition: hash.h:361

TInt MxNId

Definition: network.h:4074

TAttr::Clr

void Clr()

Clears the contents of the attribute map.

Definition: attr.h:37

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 2767 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 2728 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 2684 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 4177 of file network.h.

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

Referenced by DelNode().

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

TDirNet::DelNode

void DelNode(const int &NId)

Deletes node of ID NId from the network.

Definition: network.cpp:2684

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 3069 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, AttrName);
 }

Here is the call 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 3077 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 4477 of file network.h.

References 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 4481 of file network.h.

References 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 2931 of file network.cpp.

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

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

Here is the call 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 2938 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 4359 of file network.h.

References 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 4363 of file network.h.

References 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 2822 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 4237 of file network.h.

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

4237 { return GetNodes()==0; }

TDirNet::GetNodes

int GetNodes() const

Returns the number of nodes in the network.

Definition: network.h:4134

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 4223 of file network.h.

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

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

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 4183 of file network.h.

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

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

THash::EndI

TIter EndI() const

Definition: hash.h:218

THash< TInt, TNode > NodeH

Definition: network.h:4075

Here is the call graph for this function:

int TDirNet::GetEdges ( ) const

Returns the number of edges in the network.

Definition at line 2705 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 2754 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 3094 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 3098 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 2953 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 2957 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 4189 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId.

4189 { return MxNId; }

TInt MxNId

Definition: network.h:4074

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

inline

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

Definition at line 4185 of file network.h.

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

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

THash< TInt, TNode > NodeH

Definition: network.h:4075

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

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 2761 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 4079 of file network.h.

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

4079 { return NodeH.GetDat(NId); }

THash::GetDat

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:4075

Here is the call graph for this function:

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

inlineprivate

Definition at line 4080 of file network.h.

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

4080 { return NodeH.GetDat(NId); }

THash::GetDat

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:4075

Here is the call graph for this function:

int TDirNet::GetNodes ( ) const

inline

Returns the number of nodes in the network.

Definition at line 4134 of file network.h.

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

4134 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:4075

THash::Len

int Len() const

Definition: hash.h:228

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 4232 of file network.h.

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

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

TDirNet::GetRndNId

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

Returns an ID of a random node in the network.

Definition: network.h:4230

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 4230 of file network.h.

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

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

THash< TInt, TNode > NodeH

Definition: network.h:4075

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 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 3021 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,
		TInt &	ValX
	)		const

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

Definition at line 3029 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 4435 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 4439 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 3037 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 3045 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 4449 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 4453 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 3053 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 3061 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 4463 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 4467 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 2889 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,
		TInt &	ValX
	)		const

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

Definition at line 2896 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 4317 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                                 {
     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 4321 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                               {
     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 2903 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 2910 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 4331 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                                 {
     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 4335 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                               {
     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 2917 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 2924 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 4345 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                                 {
     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 4349 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                               {
     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 3106 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 2965 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 3110 of file network.cpp.

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

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

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 2969 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 3085 of file network.cpp.

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

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

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 4487 of file network.h.

References TDirNet::TEdgeI::GetDstNId(), 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 2945 of file network.cpp.

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

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

Here is the call 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 4370 of file network.h.

References TDirNet::TNodeI::GetId().

                                                                                        {
     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 2839 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 2618 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 2748 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 4179 of file network.h.

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

4179 { return NodeH.IsKey(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:4075

THash::IsKey

bool IsKey(const TKey &Key) const

Definition: hash.h:258

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 2776 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 4113 of file network.h.

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

TDirNet::TDirNet

TDirNet()

Definition: network.h:4096

PDirNet

TPt< TDirNet > PDirNet

Pointer to a directed network (TDirNet)

Definition: network.h:3379

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 4115 of file network.h.

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

void TDirNet::LoadNetworkShM ( TShMIn & ShMIn )

inlineprivate

Definition at line 4088 of file network.h.

References TAttr::Load(), and THash< TKey, TDat, THashFunc >::LoadShM().

Referenced by LoadShM().

                                      {
     MxNId = TInt(ShMIn);
     TNodeFunctor f;
     NodeH.LoadShM(ShMIn, f);
     SAttrN.Load(ShMIn);
     SAttrE = TAttrPair(ShMIn);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

static PDirNet TDirNet::LoadShM ( TShMIn & ShMIn )

inlinestatic

Static constructor that loads the network from 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 4123 of file network.h.

References LoadNetworkShM().

                                         {
     TDirNet* Network = new TDirNet();
     Network->LoadNetworkShM(ShMIn);
     return PDirNet(Network);
   }

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 4107 of file network.h.

Referenced by GetSmallGraph().

4107 { return new TDirNet(); }

TDirNet::TDirNet

TDirNet()

Definition: network.h:4096

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 4111 of file network.h.

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

TDirNet::TDirNet

TDirNet()

Definition: network.h:4096

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

inline

Definition at line 4130 of file network.h.

References MxNId, and NodeH.

4130 {

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

THash< TInt, TNode > NodeH

Definition: network.h:4075

TInt MxNId

Definition: network.h:4074

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

inline

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

Definition at line 4241 of file network.h.

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

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

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:222

THash< TInt, TNode > NodeH

Definition: network.h:4075

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 4243 of file network.h.

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

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

TDirNet::GetNode

TNode & GetNode(const int &NId)

Definition: network.h:4079

TDirNet::TNode::InNIdV

TIntV InNIdV

Definition: network.h:3974

TVec::Reserve

void Reserve(const TSizeTy &_MxVals)

Reserves enough memory for the vector to store _MxVals elements.

Definition: ds.h:543

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 4245 of file network.h.

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

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

TDirNet::GetNode

TNode & GetNode(const int &NId)

Definition: network.h:4079

TDirNet::TNode::OutNIdV

TIntV OutNIdV

Definition: network.h:3974

TVec::Reserve

void Reserve(const TSizeTy &_MxVals)

Reserves enough memory for the vector to store _MxVals elements.

Definition: ds.h:543

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 4103 of file network.h.

References TAttr::Save(), TAttrPair::Save(), THash< TKey, TDat, THashFunc >::Save(), and TInt::Save().

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

TInt::Save

void Save(TSOut &SOut) const

Definition: dt.h:1153

TAttrPair SAttrE

Definition: network.h:4077

THash::Save

void Save(TSOut &SOut) const

Definition: hash.h:183

TAttr SAttrN

Definition: network.h:4076

TAttrPair::Save

void Save(TSOut &SOut) const

Saves the attributes to a (binary) stream SOut.

Definition: attr.h:118

THash< TInt, TNode > NodeH

Definition: network.h:4075

TAttr::Save

void Save(TSOut &SOut) const

Saves the attributes to a (binary) stream SOut.

Definition: attr.h:33

TInt MxNId

Definition: network.h:4074

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 4105 of file network.h.

References THash< TKey, TDat, THashFunc >::Save(), and TInt::Save().

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