SNAP Library 2.3, Developer Reference: TNEANet Class Reference

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

Here is the call graph for this function:

void TNEANet::AttrNameEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TStrV &	Names
	)		const

Definition at line 147 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsDeleted(), THashKeyDatI< TKey, TDat >::GetKey(), and THashKeyDatI< TKey, TDat >::IsEnd().

                                                                                     {
   Names = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (!EdgeAttrIsDeleted(EId, EdgeHI)) {
       Names.Add(EdgeHI.GetKey());
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::AttrNameNI	(	const TInt &	NId,
		TStrV &	Names
	)		const

inline

Returns a vector of attr names for node NId.

Definition at line 1943 of file network.h.

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

1943 {

1944 AttrNameNI(NId, KeyToIndexTypeN.BegI(), Names);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TNEANet::AttrNameNI

void AttrNameNI(const TInt &NId, TStrV &Names) const

Returns a vector of attr names for node NId.

Definition: network.h:1943

Here is the call graph for this function:

void TNEANet::AttrNameNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TStrV &	Names
	)		const

Definition at line 25 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), THashKeyDatI< TKey, TDat >::GetKey(), THashKeyDatI< TKey, TDat >::IsEnd(), and NodeAttrIsDeleted().

                                                                                     {
   Names = TVec<TStr>();
   while (!NodeHI.IsEnd()) {
     if (!NodeAttrIsDeleted(NId, NodeHI)) {
       Names.Add(NodeHI.GetKey());
     }
     NodeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::AttrValueEI	(	const TInt &	EId,
		TStrV &	Values
	)		const

inline

Returns a vector of attr values for edge EId.

Definition at line 1980 of file network.h.

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

1980 {

1981 AttrValueEI(EId, KeyToIndexTypeE.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::AttrValueEI

void AttrValueEI(const TInt &EId, TStrV &Values) const

Returns a vector of attr values for edge EId.

Definition: network.h:1980

Here is the call graph for this function:

void TNEANet::AttrValueEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TStrV &	Values
	)		const

Definition at line 157 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsDeleted(), GetNodeAttrValue(), and THashKeyDatI< TKey, TDat >::IsEnd().

                                                                                       {
   Values = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (!EdgeAttrIsDeleted(EId, EdgeHI)) {
       Values.Add(GetNodeAttrValue(EId, EdgeHI));
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::AttrValueNI	(	const TInt &	NId,
		TStrV &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 1947 of file network.h.

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

1947 {

1948 AttrValueNI(NId, KeyToIndexTypeN.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TNEANet::AttrValueNI

void AttrValueNI(const TInt &NId, TStrV &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:1947

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

Here is the call graph for this function:

void TNEANet::AttrValueNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TStrV &	Values
	)		const

Definition at line 35 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), GetNodeAttrValue(), THashKeyDatI< TKey, TDat >::IsEnd(), and NodeAttrIsDeleted().

                                                                                        {
   Values = TVec<TStr>();
   while (!NodeHI.IsEnd()) {
     if (!NodeAttrIsDeleted(NId, NodeHI)) {
       Values.Add(GetNodeAttrValue(NId, NodeHI));
     }
     NodeHI++;
   }
 }

Here is the call graph for this function:

TAFltI TNEANet::BegEAFltI ( const TStr & attr ) const

inline

Returns an iterator referring to the first edge's flt attribute.

Definition at line 2032 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsE.

                                            {
     return TAFltI(VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2].BegI(), attr, true, this);
   }

Here is the call graph for this function:

TAIntI TNEANet::BegEAIntI ( const TStr & attr ) const

inline

Returns an iterator referring to the first edge's int attribute.

Definition at line 2009 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsE.

                                            {
     return TAIntI(VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2].BegI(), attr, true, this);
   }

Here is the call graph for this function:

TAStrI TNEANet::BegEAStrI ( const TStr & attr ) const

inline

Returns an iterator referring to the first edge's str attribute.

Definition at line 2021 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsE.

2021 {

2022 return TAStrI(VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2].BegI(), attr, true, this); }

TNEANet::VecOfStrVecsE

TVec< TStrV > VecOfStrVecsE

Definition: network.h:1838

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TVal2 Val2

Definition: ds.h:35

Here is the call graph for this function:

TEdgeI TNEANet::BegEI ( ) const

inline

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

Definition at line 2076 of file network.h.

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

Referenced by Dump().

2076 { return TEdgeI(EdgeH.BegI(), this); }

TIter BegI() const

Definition: hash.h:171

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

Here is the call graph for this function:

Here is the caller graph for this function:

TAFltI TNEANet::BegNAFltI ( const TStr & attr ) const

inline

Returns an iterator referring to the first node's flt attribute.

Definition at line 1933 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsN.

1933 {

1934 return TAFltI(VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2].BegI(), attr, false, this); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:1839

TVal2 Val2

Definition: ds.h:35

Here is the call graph for this function:

TAIntI TNEANet::BegNAIntI ( const TStr & attr ) const

inline

Returns an iterator referring to the first node's int attribute.

Definition at line 1914 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsN.

1914 {

1915 return TAIntI(VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2].BegI(), attr, false, this); }

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:1837

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TVal2 Val2

Definition: ds.h:35

Here is the call graph for this function:

TAStrI TNEANet::BegNAStrI ( const TStr & attr ) const

inline

Returns an iterator referring to the first node's str attribute.

Definition at line 1923 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsN.

                                            {
 
     return TAStrI(VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2].BegI(), attr, false, this); }

Here is the call graph for this function:

TNodeI TNEANet::BegNI ( ) const

inline

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

Definition at line 1908 of file network.h.

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

Referenced by Dump().

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

TIter BegI() const

Definition: hash.h:171

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::Clr ( )

inline

Deletes all nodes and edges from the graph.

Definition at line 2100 of file network.h.

References THash< TKey, TDat, THashFunc >::Clr(), TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, FltDefaultsE, FltDefaultsN, IntDefaultsE, IntDefaultsN, KeyToIndexTypeE, KeyToIndexTypeN, TNodeEdgeNet< TNodeData, TEdgeData >::MxEId, TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, StrDefaultsE, StrDefaultsN, VecOfFltVecsE, VecOfFltVecsN, VecOfIntVecsE, VecOfIntVecsN, VecOfStrVecsE, and VecOfStrVecsN.

              { MxNId=0; MxEId=0; NodeH.Clr(); EdgeH.Clr(),
     KeyToIndexTypeN.Clr(), KeyToIndexTypeE.Clr(), IntDefaultsN.Clr(), IntDefaultsE.Clr(),
     StrDefaultsN.Clr(), StrDefaultsE.Clr(), FltDefaultsN.Clr(), FltDefaultsE.Clr(),
     VecOfIntVecsN.Clr(), VecOfIntVecsE.Clr(), VecOfStrVecsN.Clr(), VecOfStrVecsE.Clr(), 
     VecOfFltVecsN.Clr(), VecOfFltVecsE.Clr();}

Here is the call graph for this function:

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

Defragments the graph.

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

References THash< TKey, TDat, THashFunc >::Defrag(), EdgeH, THash< TKey, TDat, THashFunc >::FFirstKeyId(), THash< TKey, TDat, THashFunc >::FNextKeyId(), TNEANet::TNode::InEIdV, THash< TKey, TDat, THashFunc >::IsKeyIdEqKeyN(), NodeH, TNEANet::TNode::OutEIdV, and TVec< TVal, TSizeTy >::Pack().

                                               {
   for (int kid = NodeH.FFirstKeyId(); NodeH.FNextKeyId(kid); ) {
     TNode& Node = NodeH[kid];
     Node.InEIdV.Pack();  Node.OutEIdV.Pack();
   }
   if (! OnlyNodeLinks && ! NodeH.IsKeyIdEqKeyN()) { NodeH.Defrag(); }
   if (! OnlyNodeLinks && ! EdgeH.IsKeyIdEqKeyN()) { EdgeH.Defrag(); }
 }

Here is the call graph for this function:

int TNEANet::DelAttrDatE	(	const TEdgeI &	EdgeId,
		const TStr &	attr
	)

inline

Deletes the edge attribute for NodeId.

Definition at line 2192 of file network.h.

References DelAttrDatE(), and TNEANet::TEdgeI::GetId().

Referenced by DelAttrDatE().

2192 { return DelAttrDatE(EdgeId.GetId(), attr); }

TNEANet::DelAttrDatE

int DelAttrDatE(const TEdgeI &EdgeId, const TStr &attr)

Deletes the edge attribute for NodeId.

Definition: network.h:2192

Here is the call graph for this function:

Here is the caller graph for this function:

int TNEANet::DelAttrDatE	(	const int &	EId,
		const TStr &	attr
	)

Definition at line 808 of file network.cpp.

References EdgeH, FltType, THash< TKey, TDat, THashFunc >::GetDat(), GetFltAttrDefaultE(), GetIntAttrDefaultE(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetStrAttrDefaultE(), IntType, KeyToIndexTypeE, StrType, TPair< TVal1, TVal2 >::Val2, VecOfFltVecsE, VecOfIntVecsE, and VecOfStrVecsE.

                                                          {
   // TODO(nkhadke): add error checking
   TInt vecType = KeyToIndexTypeE(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = GetIntAttrDefaultE(attr);
   } else if (vecType == StrType) {
     VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = GetStrAttrDefaultE(attr);
   } else if (vecType == FltType) {
     VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = GetFltAttrDefaultE(attr);
   } else {
     return -1;
   }
   return 0;
 }

Here is the call graph for this function:

int TNEANet::DelAttrDatN	(	const TNodeI &	NodeId,
		const TStr &	attr
	)

inline

Deletes the node attribute for NodeId.

Definition at line 2189 of file network.h.

References DelAttrDatN(), and TNEANet::TNodeI::GetId().

Referenced by DelAttrDatN().

2189 { return DelAttrDatN(NodeId.GetId(), attr); }

TNEANet::DelAttrDatN

int DelAttrDatN(const TNodeI &NodeId, const TStr &attr)

Deletes the node attribute for NodeId.

Definition: network.h:2189

Here is the call graph for this function:

Here is the caller graph for this function:

int TNEANet::DelAttrDatN	(	const int &	NId,
		const TStr &	attr
	)

Definition at line 794 of file network.cpp.

References FltType, THash< TKey, TDat, THashFunc >::GetDat(), GetFltAttrDefaultN(), GetIntAttrDefaultN(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetStrAttrDefaultN(), IntType, KeyToIndexTypeN, NodeH, StrType, TPair< TVal1, TVal2 >::Val2, VecOfFltVecsN, VecOfIntVecsN, and VecOfStrVecsN.

                                                          {
   TInt vecType = KeyToIndexTypeN(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = GetIntAttrDefaultN(attr);
   } else if (vecType == StrType) {
     VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = GetStrAttrDefaultN(attr);
   } else if (vecType == FltType) {
     VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = GetFltAttrDefaultN(attr);
   } else {
     return -1;
   }
   return 0;
 }

Here is the call graph for this function:

int TNEANet::DelAttrE ( const TStr & attr )

Removes all the values for edge attr.

Definition at line 963 of file network.cpp.

References THash< TKey, TDat, THashFunc >::DelKey(), FltDefaultsE, FltType, THash< TKey, TDat, THashFunc >::GetDat(), IntDefaultsE, IntType, THash< TKey, TDat, THashFunc >::IsKey(), KeyToIndexTypeE, StrDefaultsE, StrType, TPair< TVal1, TVal2 >::Val2, VecOfFltVecsE, VecOfIntVecsE, and VecOfStrVecsE.

                                       {
   TInt vecType = KeyToIndexTypeE(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2] = TVec<TInt>();
     if (IntDefaultsE.IsKey(attr)) {
       IntDefaultsE.DelKey(attr);
     }
   } else if (vecType == StrType) {
     VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2] = TVec<TStr>();
     if (StrDefaultsE.IsKey(attr)) {
       StrDefaultsE.DelKey(attr);
     }  
   } else if (vecType == FltType) {
     VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2] = TVec<TFlt>();
     if (FltDefaultsE.IsKey(attr)) {
       FltDefaultsE.DelKey(attr);
     }
   } else {
     return -1;
   }
   KeyToIndexTypeE.DelKey(attr);
   return 0;
 }

Here is the call graph for this function:

int TNEANet::DelAttrN ( const TStr & attr )

Removes all the values for node attr.

Definition at line 939 of file network.cpp.

References THash< TKey, TDat, THashFunc >::DelKey(), FltDefaultsN, FltType, THash< TKey, TDat, THashFunc >::GetDat(), IntDefaultsN, IntType, THash< TKey, TDat, THashFunc >::IsKey(), KeyToIndexTypeN, StrDefaultsN, StrType, TPair< TVal1, TVal2 >::Val2, VecOfFltVecsN, VecOfIntVecsN, and VecOfStrVecsN.

                                       {
   TInt vecType = KeyToIndexTypeN(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TInt>();
     if (IntDefaultsN.IsKey(attr)) {
       IntDefaultsN.DelKey(attr);
     }
   } else if (vecType == StrType) {
     VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TStr>();  
     if (StrDefaultsN.IsKey(attr)) {
       StrDefaultsN.DelKey(attr);
     }
   } else if (vecType == FltType) {
     VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TFlt>();
     if (FltDefaultsN.IsKey(attr)) {
       FltDefaultsN.DelKey(attr);
     }
   } else {
     return -1;
   }
   KeyToIndexTypeN.DelKey(attr);
   return 0;
 }

Here is the call graph for this function:

void TNEANet::DelEdge ( const int & EId )

Deletes an edge with edge ID EId from the graph.

Definition at line 425 of file network.cpp.

References TVec< TVal, TSizeTy >::DelIfIn(), THash< TKey, TDat, THashFunc >::DelKey(), EdgeH, TNEANet::TEdge::GetDstNId(), GetEdge(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetNode(), TStr::GetNullStr(), TNEANet::TEdge::GetSrcNId(), IAssert, TNEANet::TNode::InEIdV, TVec< TVal, TSizeTy >::Ins(), IsEdge(), TInt::Mn, TFlt::Mn, TNEANet::TNode::OutEIdV, VecOfFltVecsE, VecOfIntVecsE, and VecOfStrVecsE.

Referenced by DelEdge().

                                     {
   int i;
 
   IAssert(IsEdge(EId));
   const int SrcNId = GetEdge(EId).GetSrcNId();
   const int DstNId = GetEdge(EId).GetDstNId();
   GetNode(SrcNId).OutEIdV.DelIfIn(EId);
   GetNode(DstNId).InEIdV.DelIfIn(EId);
   EdgeH.DelKey(EId);
 
   for (i = 0; i < VecOfIntVecsE.Len(); i++) {
     TVec<TInt>& IntVec = VecOfIntVecsE[i];
     IntVec.Ins(EdgeH.GetKeyId(EId), TInt::Mn);
   }
   for (i = 0; i < VecOfStrVecsE.Len(); i++) {
     TVec<TStr>& StrVec = VecOfStrVecsE[i];
     StrVec.Ins(EdgeH.GetKeyId(EId), TStr::GetNullStr());
   }
   for (i = 0; i < VecOfFltVecsE.Len(); i++) {
     TVec<TFlt>& FltVec = VecOfFltVecsE[i];
     FltVec.Ins(EdgeH.GetKeyId(EId), TFlt::Mn);
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::DelEdge	(	const int &	SrcNId,
		const int &	DstNId,
		const bool &	IsDir = `true`
	)

Deletes all edges between node IDs SrcNId and DstNId from the graph.

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

References DelEdge(), IAssert, and IsEdge().

                                                                              {
   int EId = 0;
   bool Edge = IsEdge(SrcNId, DstNId, EId, IsDir);
   IAssert(Edge); // there is at least one edge
   while (Edge) {
     DelEdge(EId);
     Edge = IsEdge(SrcNId, DstNId, EId, IsDir);
   }
 }

Here is the call graph for this function:

void TNEANet::DelNode ( const int & NId )

Deletes node of ID NId from the graph.

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

Definition at line 315 of file network.cpp.

References THash< TKey, TDat, THashFunc >::DelKey(), EdgeH, TNEANet::TEdge::GetDstNId(), GetEdge(), TNEANet::TNode::GetInDeg(), TNEANet::TNode::GetInEId(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetNode(), TStr::GetNullStr(), TNEANet::TNode::GetOutDeg(), TNEANet::TNode::GetOutEId(), TNEANet::TEdge::GetSrcNId(), IAssert, TInt::Mn, TFlt::Mn, NodeH, VecOfFltVecsE, VecOfFltVecsN, VecOfIntVecsE, VecOfIntVecsN, VecOfStrVecsE, and VecOfStrVecsN.

                                     {
   int i;
   
   const TNode& Node = GetNode(NId);
   for (int out = 0; out < Node.GetOutDeg(); out++) {
     const int EId = Node.GetOutEId(out);
     const TEdge& Edge = GetEdge(EId);
     IAssert(Edge.GetSrcNId() == NId);
     GetNode(Edge.GetDstNId()).InEIdV.DelIfIn(EId);
     // Delete from Edge Attributes
     for (i = 0; i < VecOfIntVecsE.Len(); i++) {
       TVec<TInt>& IntVec = VecOfIntVecsE[i];
       IntVec[EdgeH.GetKeyId(EId)] = TInt::Mn;
     }
     for (i = 0; i < VecOfStrVecsE.Len(); i++) {
       TVec<TStr>& StrVec = VecOfStrVecsE[i];
       StrVec[EdgeH.GetKeyId(EId)] = TStr::GetNullStr();
     }
     for (i = 0; i < VecOfFltVecsE.Len(); i++) {
       TVec<TFlt>& FltVec = VecOfFltVecsE[i];
       FltVec[EdgeH.GetKeyId(EId)] = TFlt::Mn;
     }
     EdgeH.DelKey(EId);
   }
   for (int in = 0; in < Node.GetInDeg(); in++) {
     const int EId = Node.GetInEId(in);
     const TEdge& Edge = GetEdge(EId);
     IAssert(Edge.GetDstNId() == NId);
     GetNode(Edge.GetSrcNId()).OutEIdV.DelIfIn(EId);
     // Delete from Edge Attributes
     for (i = 0; i < VecOfIntVecsE.Len(); i++) {
       TVec<TInt>& IntVec = VecOfIntVecsE[i];
       IntVec[EdgeH.GetKeyId(EId)] = TInt::Mn;
     }
     for (i = 0; i < VecOfStrVecsE.Len(); i++) {
       TVec<TStr>& StrVec = VecOfStrVecsE[i];
       StrVec[EdgeH.GetKeyId(EId)] = TStr::GetNullStr();
     }
     for (i = 0; i < VecOfFltVecsE.Len(); i++) {
       TVec<TFlt>& FltVec = VecOfFltVecsE[i];
       FltVec[EdgeH.GetKeyId(EId)] = TFlt::Mn;
     }
     EdgeH.DelKey(EId);
   }
 
   for (i = 0; i < VecOfIntVecsN.Len(); i++) {
     TVec<TInt>& IntVec = VecOfIntVecsN[i];
     IntVec[NodeH.GetKeyId(NId)] = TInt::Mn;
   }
   for (i = 0; i < VecOfStrVecsN.Len(); i++) {
     TVec<TStr>& StrVec = VecOfStrVecsN[i];
     StrVec[NodeH.GetKeyId(NId)] = TStr::GetNullStr();
   }
   for (i = 0; i < VecOfFltVecsN.Len(); i++) {
     TVec<TFlt>& FltVec = VecOfFltVecsN[i];
     FltVec[NodeH.GetKeyId(NId)] = TFlt::Mn;
   }
   NodeH.DelKey(NId);
 }

Here is the call graph for this function:

void TNEANet::DelNode ( const TNode & NodeI )

inline

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

Definition at line 1904 of file network.h.

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

Referenced by DelNode().

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

TNEANet::DelNode

void DelNode(const int &NId)

Deletes node of ID NId from the graph.

Definition: network.cpp:315

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 557 of file network.cpp.

References BegEI(), BegNI(), EndEI(), EndNI(), FltAttrValueEI(), FltAttrValueNI(), GetEdges(), GetNodes(), IntAttrValueEI(), IntAttrValueNI(), TVec< TVal, TSizeTy >::Len(), StrAttrValueEI(), and StrAttrValueNI().

                                    {
   const int NodePlaces = (int) ceil(log10((double) GetNodes()));
   const int EdgePlaces = (int) ceil(log10((double) GetEdges()));
   fprintf(OutF, "-------------------------------------------------\nDirected Node-Edge Network: nodes: %d, edges: %d\n", GetNodes(), GetEdges());
   for (TNodeI NodeI = BegNI(); NodeI < EndNI(); NodeI++) {
     fprintf(OutF, "  %*d]\n", NodePlaces, NodeI.GetId());
     // load node attributes
     TIntV IntAttrN;
     IntAttrValueNI(NodeI.GetId(), IntAttrN);
     fprintf(OutF, "    nai[%d]", IntAttrN.Len());
     for (int i = 0; i < IntAttrN.Len(); i++) {
       fprintf(OutF, " %*i", NodePlaces, IntAttrN[i]()); }
     TStrV StrAttrN;
     StrAttrValueNI(NodeI.GetId(), StrAttrN);
     fprintf(OutF, "    nas[%d]", StrAttrN.Len());
     for (int i = 0; i < StrAttrN.Len(); i++) {
       fprintf(OutF, " %*s", NodePlaces, StrAttrN[i]()); }
     TFltV FltAttrN;
     FltAttrValueNI(NodeI.GetId(), FltAttrN);
     fprintf(OutF, "    naf[%d]", FltAttrN.Len());
     for (int i = 0; i < FltAttrN.Len(); i++) {
       fprintf(OutF, " %*f", NodePlaces, FltAttrN[i]()); }
 
     fprintf(OutF, "    in[%d]", NodeI.GetInDeg());
     for (int edge = 0; edge < NodeI.GetInDeg(); edge++) {
       fprintf(OutF, " %*d", EdgePlaces, NodeI.GetInEId(edge)); }
     fprintf(OutF, "\n");
     fprintf(OutF, "    out[%d]", NodeI.GetOutDeg());
     for (int edge = 0; edge < NodeI.GetOutDeg(); edge++) {
       fprintf(OutF, " %*d", EdgePlaces, NodeI.GetOutEId(edge)); }
     fprintf(OutF, "\n");
   }
   for (TEdgeI EdgeI = BegEI(); EdgeI < EndEI(); EdgeI++) {
     fprintf(OutF, "  %*d]  %*d  ->  %*d\n", EdgePlaces, EdgeI.GetId(), NodePlaces, EdgeI.GetSrcNId(), NodePlaces, EdgeI.GetDstNId());
 
     // load edge attributes
     TIntV IntAttrE;
     IntAttrValueEI(EdgeI.GetId(), IntAttrE);
     fprintf(OutF, "    eai[%d]", IntAttrE.Len());
     for (int i = 0; i < IntAttrE.Len(); i++) {
       fprintf(OutF, " %*i", EdgePlaces, IntAttrE[i]()); }
     TStrV StrAttrE;
     StrAttrValueEI(EdgeI.GetId(), StrAttrE);
     fprintf(OutF, "    eas[%d]", StrAttrE.Len());
     for (int i = 0; i < StrAttrE.Len(); i++) {
       fprintf(OutF, " %*s", EdgePlaces, StrAttrE[i]()); }
     TFltV FltAttrE;
     FltAttrValueEI(EdgeI.GetId(), FltAttrE);
     fprintf(OutF, "    eaf[%d]", FltAttrE.Len());
     for (int i = 0; i < FltAttrE.Len(); i++) {
       fprintf(OutF, " %*f", EdgePlaces, FltAttrE[i]()); }
   }
   fprintf(OutF, "\n");
 }

Here is the call graph for this function:

bool TNEANet::EdgeAttrIsDeleted	(	const int &	EId,
		const TStrIntPrH::TIter &	EdgeHI
	)		const

Definition at line 230 of file network.cpp.

References EdgeAttrIsFltDeleted(), EdgeAttrIsIntDeleted(), and EdgeAttrIsStrDeleted().

Referenced by AttrNameEI(), and AttrValueEI().

                                                                                    {
   bool IntDel = EdgeAttrIsIntDeleted(EId, EdgeHI);
   bool StrDel = EdgeAttrIsStrDeleted(EId, EdgeHI);
   bool FltDel = EdgeAttrIsFltDeleted(EId, EdgeHI);
   return IntDel || StrDel || FltDel;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::EdgeAttrIsFltDeleted	(	const int &	EId,
		const TStrIntPrH::TIter &	EdgeHI
	)		const

Definition at line 249 of file network.cpp.

References EdgeH, FltType, THashKeyDatI< TKey, TDat >::GetDat(), GetFltAttrDefaultE(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), and VecOfFltVecsE.

Referenced by EdgeAttrIsDeleted(), FltAttrNameEI(), and FltAttrValueEI().

                                                                                       {
   return (EdgeHI.GetDat().Val1 == FltType &&
     GetFltAttrDefaultE(EdgeHI.GetKey()) == this->VecOfFltVecsE.GetVal(
     this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId)));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::EdgeAttrIsIntDeleted	(	const int &	EId,
		const TStrIntPrH::TIter &	EdgeHI
	)		const

Definition at line 237 of file network.cpp.

References EdgeH, THashKeyDatI< TKey, TDat >::GetDat(), GetIntAttrDefaultE(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntType, and VecOfIntVecsE.

Referenced by EdgeAttrIsDeleted(), IntAttrNameEI(), and IntAttrValueEI().

                                                                                       {
   return (EdgeHI.GetDat().Val1 == IntType &&
     GetIntAttrDefaultE(EdgeHI.GetKey()) == this->VecOfIntVecsE.GetVal(
     this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId)));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::EdgeAttrIsStrDeleted	(	const int &	EId,
		const TStrIntPrH::TIter &	EdgeHI
	)		const

Definition at line 243 of file network.cpp.

References EdgeH, THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetStrAttrDefaultE(), StrType, and VecOfStrVecsE.

Referenced by EdgeAttrIsDeleted(), StrAttrNameEI(), and StrAttrValueEI().

                                                                                       {
   return (EdgeHI.GetDat().Val1 == StrType &&
     GetStrAttrDefaultE(EdgeHI.GetKey()) == this->VecOfStrVecsE.GetVal(
     this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId)));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::Empty ( ) const

inline

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

Definition at line 2098 of file network.h.

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

2098 { return GetNodes()==0; }

TNEANet::GetNodes

int GetNodes() const

Returns the number of nodes in the graph.

Definition: network.h:1890

Here is the call graph for this function:

TAFltI TNEANet::EndEAFltI ( const TStr & attr ) const

inline

Returns an iterator referring to the past-the-end edge's attribute.

Definition at line 2036 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsE.

                                            {
     return TAFltI(VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2].EndI(), attr, true, this);
   }

Here is the call graph for this function:

TAIntI TNEANet::EndEAIntI ( const TStr & attr ) const

inline

Returns an iterator referring to the past-the-end edge's attribute.

Definition at line 2013 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsE.

                                            {
     return TAIntI(VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2].EndI(), attr, true, this);
   }

Here is the call graph for this function:

TAStrI TNEANet::EndEAStrI ( const TStr & attr ) const

inline

Returns an iterator referring to the past-the-end edge's attribute.

Definition at line 2024 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsE.

                                            {
     return TAStrI(VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2].EndI(), attr, true, this);
   }

Here is the call graph for this function:

TEdgeI TNEANet::EndEI ( ) const

inline

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

Definition at line 2078 of file network.h.

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

Referenced by Dump().

2078 { return TEdgeI(EdgeH.EndI(), this); }

THash::EndI

TIter EndI() const

Definition: hash.h:176

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

Here is the call graph for this function:

Here is the caller graph for this function:

TAFltI TNEANet::EndNAFltI ( const TStr & attr ) const

inline

Returns an iterator referring to the past-the-end node's attribute.

Definition at line 1936 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsN.

1936 {

1937 return TAFltI(VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2].EndI(), attr, false, this); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:1839

TVal2 Val2

Definition: ds.h:35

Here is the call graph for this function:

TAIntI TNEANet::EndNAIntI ( const TStr & attr ) const

inline

Returns an iterator referring to the past-the-end node's attribute.

Definition at line 1917 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsN.

1917 {

1918 return TAIntI(VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2].EndI(), attr, false, this); }

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:1837

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TVal2 Val2

Definition: ds.h:35

Here is the call graph for this function:

TAStrI TNEANet::EndNAStrI ( const TStr & attr ) const

inline

Returns an iterator referring to the past-the-end node's attribute.

Definition at line 1927 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsN.

1927 {

1928 return TAStrI(VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2].EndI(), attr, false, this); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TNEANet::VecOfStrVecsN

TVec< TStrV > VecOfStrVecsN

Definition: network.h:1838

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TVal2 Val2

Definition: ds.h:35

Here is the call graph for this function:

TNodeI TNEANet::EndNI ( ) const

inline

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

Definition at line 1910 of file network.h.

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

Referenced by Dump().

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

THash::EndI

TIter EndI() const

Definition: hash.h:176

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::FltAttrNameEI	(	const TInt &	EId,
		TStrV &	Names
	)		const

inline

Returns a vector of int attr names for node NId.

Definition at line 2000 of file network.h.

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

2000 {

2001 FltAttrNameEI(EId, KeyToIndexTypeE.BegI(), Names);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::FltAttrNameEI

void FltAttrNameEI(const TInt &EId, TStrV &Names) const

Returns a vector of int attr names for node NId.

Definition: network.h:2000

Here is the call graph for this function:

void TNEANet::FltAttrNameEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TStrV &	Names
	)		const

Definition at line 209 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsFltDeleted(), FltType, THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), and THashKeyDatI< TKey, TDat >::IsEnd().

                                                                                        {
   Names = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == FltType && !EdgeAttrIsFltDeleted(EId, EdgeHI)) {
       Names.Add(EdgeHI.GetKey());
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::FltAttrNameNI	(	const TInt &	NId,
		TStrV &	Names
	)		const

inline

Returns a vector of int attr names for node NId.

Definition at line 1967 of file network.h.

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

1967 {

1968 FltAttrNameNI(NId, KeyToIndexTypeN.BegI(), Names);}

TNEANet::FltAttrNameNI

void FltAttrNameNI(const TInt &NId, TStrV &Names) const

Returns a vector of int attr names for node NId.

Definition: network.h:1967

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

Here is the call graph for this function:

void TNEANet::FltAttrNameNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TStrV &	Names
	)		const

Definition at line 87 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), FltType, THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THashKeyDatI< TKey, TDat >::IsEnd(), and NodeAttrIsFltDeleted().

                                                                                        {
   Names = TVec<TStr>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == FltType && !NodeAttrIsFltDeleted(NId, NodeHI)) {
       Names.Add(NodeHI.GetKey());
     }
     NodeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::FltAttrValueEI	(	const TInt &	EId,
		TFltV &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 2004 of file network.h.

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

Referenced by Dump().

2004 {

2005 FltAttrValueEI(EId, KeyToIndexTypeE.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::FltAttrValueEI

void FltAttrValueEI(const TInt &EId, TFltV &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:2004

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::FltAttrValueEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TFltV &	Values
	)		const

Definition at line 219 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsFltDeleted(), FltType, THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::IsEnd(), and VecOfFltVecsE.

                                                                                          {
   Values = TVec<TFlt>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == FltType && !EdgeAttrIsFltDeleted(EId, EdgeHI)) {
       TFlt val = (this->VecOfFltVecsE.GetVal(EdgeHI.GetDat().Val2).GetVal(EId));
       Values.Add(val);
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::FltAttrValueNI	(	const TInt &	NId,
		TFltV &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 1971 of file network.h.

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

Referenced by Dump().

1971 {

1972 FltAttrValueNI(NId, KeyToIndexTypeN.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TNEANet::FltAttrValueNI

void FltAttrValueNI(const TInt &NId, TFltV &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:1971

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::FltAttrValueNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TFltV &	Values
	)		const

Definition at line 97 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), FltType, THashKeyDatI< TKey, TDat >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), THashKeyDatI< TKey, TDat >::IsEnd(), NodeAttrIsFltDeleted(), NodeH, and VecOfFltVecsN.

                                                                                          {
   Values = TVec<TFlt>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == FltType && !NodeAttrIsFltDeleted(NId, NodeHI)) {
       TFlt val = (this->VecOfFltVecsN.GetVal(NodeHI.GetDat().Val2).GetVal(NodeH.GetKeyId(NId)));
       Values.Add(val);
     }
     NodeHI++;
   }  
 }

Here is the call graph for this function:

TAFltI TNEANet::GetEAFltI	(	const TStr &	attr,
		const int &	EId
	)		const

inline

Returns an iterator referring to the edge of ID EId in the graph.

Definition at line 2040 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsE.

                                                            {
     return TAFltI(VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2].GetI(EdgeH.GetKeyId(EId)), attr, true, this);
   }

Here is the call graph for this function:

TAIntI TNEANet::GetEAIntI	(	const TStr &	attr,
		const int &	EId
	)		const

inline

Returns an iterator referring to the edge of ID EId in the graph.

Definition at line 2017 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsE.

                                                            {
     return TAIntI(VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2].GetI(EdgeH.GetKeyId(EId)), attr, true, this);
   }

Here is the call graph for this function:

TAStrI TNEANet::GetEAStrI	(	const TStr &	attr,
		const int &	EId
	)		const

inline

Returns an iterator referring to the edge of ID EId in the graph.

Definition at line 2028 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsE.

                                                            {
     return TAStrI(VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2].GetI(EdgeH.GetKeyId(EId)), attr, true, this);
   }

Here is the call graph for this function:

TEdge& TNEANet::GetEdge ( const int & EId )

inlineprivate

Definition at line 1810 of file network.h.

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

Referenced by DelEdge(), DelNode(), IsEdge(), and TNEANet::TNodeI::IsInNId().

1810 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

Here is the call graph for this function:

Here is the caller graph for this function:

const TEdge& TNEANet::GetEdge ( const int & EId ) const

inlineprivate

Definition at line 1811 of file network.h.

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

1811 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

Here is the call graph for this function:

TStr TNEANet::GetEdgeAttrValue	(	const int &	EId,
		const TStrIntPrH::TIter &	EdgeHI
	)		const

Definition at line 255 of file network.cpp.

References EdgeH, FltType, THashKeyDatI< TKey, TDat >::GetDat(), THash< TKey, TDat, THashFunc >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), TStr::GetNullStr(), TStr::GetStr(), IntType, KeyToIndexTypeE, StrType, VecOfFltVecsE, VecOfIntVecsE, and VecOfStrVecsE.

                                                                                   {
   if (EdgeHI.GetDat().Val1 == IntType) {
     return (this->VecOfIntVecsE.GetVal(
       this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId))).GetStr();
   } else if(EdgeHI.GetDat().Val1 == StrType) {
     return this->VecOfStrVecsE.GetVal(
     this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId));
   } else if (EdgeHI.GetDat().Val1 == FltType) {
     return (this->VecOfFltVecsE.GetVal(
       this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId))).GetStr();
   }
   return TStr::GetNullStr();
 }

Here is the call graph for this function:

int TNEANet::GetEdges ( ) const

inline

Returns the number of edges in the graph.

Definition at line 2049 of file network.h.

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

Referenced by Dump(), and GetEIdV().

2049 { return EdgeH.Len(); }

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

THash::Len

int Len() const

Definition: hash.h:186

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

Returns an iterator referring to edge with edge ID EId.

Definition at line 2080 of file network.h.

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

2080 { return TEdgeI(EdgeH.GetI(EId), this); }

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:178

Here is the call graph for this function:

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

inline

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

Definition at line 2082 of file network.h.

References GetEI(), and TNodeEdgeNet< TNodeData, TEdgeData >::GetEId().

Referenced by GetEI().

2082 { return GetEI(GetEId(SrcNId, DstNId)); }

TNEANet::GetEI

TEdgeI GetEI(const int &EId) const

Returns an iterator referring to edge with edge ID EId.

Definition: network.h:2080

TNEANet::GetEId

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

Returns an edge ID between node IDs SrcNId and DstNId, if such an edge exists. Otherwise, return -1.

Definition: network.h:2074

Here is the call graph for this function:

Here is the caller graph for this function:

int TNEANet::GetEId	(	const int &	SrcNId,
		const int &	DstNId
	)		const

inline

Returns an edge ID between node IDs SrcNId and DstNId, if such an edge exists. Otherwise, return -1.

Definition at line 2074 of file network.h.

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

2074 { int EId; return IsEdge(SrcNId, DstNId, EId)?EId:-1; }

TNEANet::IsEdge

bool IsEdge(const int &EId) const

Tests whether an edge with edge ID EId exists in the graph.

Definition: network.h:2068

Here is the call graph for this function:

void TNEANet::GetEIdV ( TIntV & EIdV ) const

Gets a vector IDs of all edges in the graph.

Definition at line 488 of file network.cpp.

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

                                        {
   EIdV.Gen(GetEdges(), 0);
   for (int E=EdgeH.FFirstKeyId(); EdgeH.FNextKeyId(E); ) {
     EIdV.Add(EdgeH.GetKey(E));
   }
 }

Here is the call graph for this function:

TFlt TNEANet::GetFltAttrDatE	(	const TEdgeI &	EdgeId,
		const TStr &	attr
	)

inline

Gets the value of flt attr from the edge attr value vector.

Definition at line 2179 of file network.h.

References GetFltAttrDatE(), and TNEANet::TEdgeI::GetId().

Referenced by GetFltAttrDatE().

2179 { return GetFltAttrDatE(EdgeId.GetId(), attr); }

TNEANet::GetFltAttrDatE

TFlt GetFltAttrDatE(const TEdgeI &EdgeId, const TStr &attr)

Gets the value of flt attr from the edge attr value vector.

Definition: network.h:2179

Here is the call graph for this function:

Here is the caller graph for this function:

TFlt TNEANet::GetFltAttrDatE	(	const int &	EId,
		const TStr &	attr
	)

Definition at line 790 of file network.cpp.

References EdgeH, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsE.

                                                              {
   return VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)];
 }

Here is the call graph for this function:

TFlt TNEANet::GetFltAttrDatN	(	const TNodeI &	NodeId,
		const TStr &	attr
	)

inline

Gets the value of flt attr from the node attr value vector.

Definition at line 2163 of file network.h.

References GetFltAttrDatN(), and TNEANet::TNodeI::GetId().

Referenced by GetFltAttrDatN().

2163 { return GetFltAttrDatN(NodeId.GetId(), attr); }

TNEANet::GetFltAttrDatN

TFlt GetFltAttrDatN(const TNodeI &NodeId, const TStr &attr)

Gets the value of flt attr from the node attr value vector.

Definition: network.h:2163

Here is the call graph for this function:

Here is the caller graph for this function:

TFlt TNEANet::GetFltAttrDatN	(	const int &	NId,
		const TStr &	attr
	)

Definition at line 770 of file network.cpp.

References THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeN, NodeH, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsN.

                                                              {
   return VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)];
 }

Here is the call graph for this function:

TFlt TNEANet::GetFltAttrDefaultE ( const TStr & attribute ) const

inlineprivate

Get Flt edge attribute val. If not a proper attr, return default.

Definition at line 1824 of file network.h.

References FltDefaultsE, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::IsKey(), and TFlt::Mn.

Referenced by AddEdge(), AddFltAttrDatE(), DelAttrDatE(), and EdgeAttrIsFltDeleted().

1824 { return FltDefaultsE.IsKey(attribute) ? FltDefaultsE.GetDat(attribute) : (TFlt) TFlt::Mn; }

TNEANet::FltDefaultsE

THash< TStr, TFlt > FltDefaultsE

Definition: network.h:1836

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TFlt

Definition: dt.h:1289

bool IsKey(const TKey &Key) const

Definition: hash.h:216

TFlt::Mn

static const double Mn

Definition: dt.h:1293

Here is the call graph for this function:

Here is the caller graph for this function:

TFlt TNEANet::GetFltAttrDefaultN ( const TStr & attribute ) const

inlineprivate

Get Flt node attribute val. If not a proper attr, return default.

Definition at line 1818 of file network.h.

References FltDefaultsN, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::IsKey(), and TFlt::Mn.

Referenced by AddFltAttrDatN(), AddNode(), DelAttrDatN(), and NodeAttrIsFltDeleted().

1818 { return FltDefaultsN.IsKey(attribute) ? FltDefaultsN.GetDat(attribute) : (TFlt) TFlt::Mn; }

TNEANet::FltDefaultsN

THash< TStr, TFlt > FltDefaultsN

Definition: network.h:1836

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TFlt

Definition: dt.h:1289

bool IsKey(const TKey &Key) const

Definition: hash.h:216

TFlt::Mn

static const double Mn

Definition: dt.h:1293

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrDatE	(	const TEdgeI &	EdgeId,
		const TStr &	attr
	)

inline

Gets the value of int attr from the edge attr value vector.

Definition at line 2173 of file network.h.

References TNEANet::TEdgeI::GetId(), and GetIntAttrDatE().

Referenced by GetIntAttrDatE().

2173 { return GetIntAttrDatE(EdgeId.GetId(), attr); }

TNEANet::GetIntAttrDatE

TInt GetIntAttrDatE(const TEdgeI &EdgeId, const TStr &attr)

Gets the value of int attr from the edge attr value vector.

Definition: network.h:2173

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrDatE	(	const int &	EId,
		const TStr &	attr
	)

Definition at line 774 of file network.cpp.

References EdgeH, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsE.

                                                              {
   return VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)];
 }

Here is the call graph for this function:

TInt TNEANet::GetIntAttrDatN	(	const TNodeI &	NodeId,
		const TStr &	attr
	)

inline

Gets the value of int attr from the node attr value vector.

Definition at line 2156 of file network.h.

References TNEANet::TNodeI::GetId(), and GetIntAttrDatN().

Referenced by GetIntAttrDatN().

2156 { return GetIntAttrDatN(NodeId.GetId(), attr); }

TNEANet::GetIntAttrDatN

TInt GetIntAttrDatN(const TNodeI &NodeId, const TStr &attr)

Gets the value of int attr from the node attr value vector.

Definition: network.h:2156

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrDatN	(	const int &	NId,
		const TStr &	attr
	)

Definition at line 754 of file network.cpp.

References THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeN, NodeH, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsN.

                                                              {
   return VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)];
 }

Here is the call graph for this function:

TInt TNEANet::GetIntAttrDefaultE ( const TStr & attribute ) const

inlineprivate

Get Int edge attribute val. If not a proper attr, return default.

Definition at line 1820 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), IntDefaultsE, THash< TKey, TDat, THashFunc >::IsKey(), and TInt::Mn.

Referenced by AddEdge(), AddIntAttrDatE(), DelAttrDatE(), and EdgeAttrIsIntDeleted().

1820 { return IntDefaultsE.IsKey(attribute) ? IntDefaultsE.GetDat(attribute) : (TInt) TInt::Mn; }

TNEANet::IntDefaultsE

THash< TStr, TInt > IntDefaultsE

Definition: network.h:1834

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TInt::Mn

static const int Mn

Definition: dt.h:1045

TInt

Definition: dt.h:1041

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrDefaultN ( const TStr & attribute ) const

inlineprivate

Get Int node attribute val. If not a proper attr, return default.

Definition at line 1814 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), IntDefaultsN, THash< TKey, TDat, THashFunc >::IsKey(), and TInt::Mn.

Referenced by AddIntAttrDatN(), AddNode(), DelAttrDatN(), and NodeAttrIsIntDeleted().

1814 { return IntDefaultsN.IsKey(attribute) ? IntDefaultsN.GetDat(attribute) : (TInt) TInt::Mn; }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TInt::Mn

static const int Mn

Definition: dt.h:1045

TInt

Definition: dt.h:1041

TNEANet::IntDefaultsN

THash< TStr, TInt > IntDefaultsN

Definition: network.h:1834

TNEANet::GetIntAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrIndDatE	(	const TEdgeI &	EdgeId,
		const int &	index
	)

inline

Gets the value of edge int attr specified by the attr index.

Definition at line 2185 of file network.h.

References TNEANet::TEdgeI::GetId(), and GetIntAttrIndDatE().

Referenced by GetIntAttrIndDatE().

2185 { return GetIntAttrIndDatE(EdgeId.GetId(), index); }

TInt GetIntAttrIndDatE(const TEdgeI &EdgeId, const int &index)

Gets the value of edge int attr specified by the attr index.

Definition: network.h:2185

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrIndDatE	(	const int &	EId,
		const int &	index
	)

Definition at line 778 of file network.cpp.

References EdgeH, THash< TKey, TDat, THashFunc >::GetKeyId(), and VecOfIntVecsE.

                                                                 {
   return VecOfIntVecsE[index][EdgeH.GetKeyId(EId)];
 }

Here is the call graph for this function:

TInt TNEANet::GetIntAttrIndDatN	(	const TNodeI &	NodeId,
		const int &	index
	)

inline

Gets the value of node int attr specified by the attr index.

Definition at line 2169 of file network.h.

References TNEANet::TNodeI::GetId(), and GetIntAttrIndDatN().

Referenced by GetIntAttrIndDatN().

2169 { return GetIntAttrIndDatN(NodeId.GetId(), index); }

TNEANet::GetIntAttrIndDatN

TInt GetIntAttrIndDatN(const TNodeI &NodeId, const int &index)

Gets the value of node int attr specified by the attr index.

Definition: network.h:2169

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::GetIntAttrIndDatN	(	const int &	NId,
		const int &	index
	)

Definition at line 758 of file network.cpp.

References THash< TKey, TDat, THashFunc >::GetKeyId(), NodeH, and VecOfIntVecsN.

                                                                 {
   return VecOfIntVecsN[index][NodeH.GetKeyId(NId)];
 }

Here is the call graph for this function:

int TNEANet::GetIntAttrIndE ( const TStr & attr )

Gets the index of the edge attr value vector specified by str attr.

Definition at line 782 of file network.cpp.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeE, and TPair< TVal1, TVal2 >::Val2.

                                             {
   return KeyToIndexTypeE.GetDat(attr).Val2.Val;
 }

Here is the call graph for this function:

int TNEANet::GetIntAttrIndN ( const TStr & attr )

Gets the index of the node attr value vector specified by str attr.

Definition at line 762 of file network.cpp.

References THash< TKey, TDat, THashFunc >::GetDat(), KeyToIndexTypeN, and TPair< TVal1, TVal2 >::Val2.

                                             {
   return KeyToIndexTypeN.GetDat(attr).Val2.Val;
 }

Here is the call graph for this function:

int TNEANet::GetMxEId ( ) const

inline

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

Definition at line 2046 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxEId.

2046 { return MxEId; }

TNEANet::MxEId

TInt MxEId

Definition: network.h:1828

int TNEANet::GetMxNId ( ) const

inline

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

Definition at line 2044 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId.

2044 { return MxNId; }

TNEANet::MxNId

TInt MxNId

Definition: network.h:1828

TAFltI TNEANet::GetNAFltI	(	const TStr &	attr,
		const int &	NId
	)		const

inline

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

Definition at line 1939 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeN, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, TPair< TVal1, TVal2 >::Val2, and VecOfFltVecsN.

1939 {

1940 return TAFltI(VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2].GetI(NodeH.GetKeyId(NId)), attr, false, this); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:420

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:1839

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

TAIntI TNEANet::GetNAIntI	(	const TStr &	attr,
		const int &	NId
	)		const

inline

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

Definition at line 1920 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeN, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, TPair< TVal1, TVal2 >::Val2, and VecOfIntVecsN.

1920 {

1921 return TAIntI(VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2].GetI(NodeH.GetKeyId(NId)), attr, false, this); }

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:1837

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:420

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

TAStrI TNEANet::GetNAStrI	(	const TStr &	attr,
		const int &	NId
	)		const

inline

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

Definition at line 1930 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeN, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsN.

1930 {

1931 return TAStrI(VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2].GetI(NodeH.GetKeyId(NId)), attr, false, this); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TNEANet::VecOfStrVecsN

TVec< TStrV > VecOfStrVecsN

Definition: network.h:1838

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:420

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

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

inline

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

Definition at line 1912 of file network.h.

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

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

THash< TInt, TNode > NodeH

Definition: network.h:1829

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:178

Here is the call graph for this function:

void TNEANet::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the graph.

Definition at line 481 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(), GetNodes(), and 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& TNEANet::GetNode ( const int & NId )

inlineprivate

Definition at line 1808 of file network.h.

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

Referenced by AddEdge(), DelEdge(), DelNode(), and IsEdge().

1808 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

Here is the caller graph for this function:

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

inlineprivate

Definition at line 1809 of file network.h.

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

1809 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

TStr TNEANet::GetNodeAttrValue	(	const int &	NId,
		const TStrIntPrH::TIter &	NodeHI
	)		const

Definition at line 133 of file network.cpp.

References FltType, THashKeyDatI< TKey, TDat >::GetDat(), THash< TKey, TDat, THashFunc >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), TStr::GetNullStr(), TStr::GetStr(), IntType, KeyToIndexTypeN, NodeH, StrType, VecOfFltVecsN, VecOfIntVecsN, and VecOfStrVecsN.

Referenced by AttrValueEI(), and AttrValueNI().

                                                                                   {
   if (NodeHI.GetDat().Val1 == IntType) {
     return (this->VecOfIntVecsN.GetVal(
       this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId))).GetStr();
   } else if(NodeHI.GetDat().Val1 == StrType) {
     return this->VecOfStrVecsN.GetVal(
     this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId));
   } else if (NodeHI.GetDat().Val1 == FltType) {
     return (this->VecOfFltVecsN.GetVal(
       this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId))).GetStr();
   }
   return TStr::GetNullStr();
 }

Here is the call graph for this function:

Here is the caller graph for this function:

int TNEANet::GetNodes ( ) const

inline

Returns the number of nodes in the graph.

Definition at line 1890 of file network.h.

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

Referenced by Dump(), and GetNIdV().

1890 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:1829

THash::Len

int Len() const

Definition: hash.h:186

Here is the call graph for this function:

Here is the caller graph for this function:

TEdgeI TNEANet::GetRndEI ( TRnd & Rnd = TInt::Rnd )

inline

Returns an interator referring to a random edge in the graph.

Definition at line 2091 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::GetEI(), and TNodeEdgeNet< TNodeData, TEdgeData >::GetRndEId().

2091 { return GetEI(GetRndEId(Rnd)); }

TNEANet::GetEI

TEdgeI GetEI(const int &EId) const

Returns an iterator referring to edge with edge ID EId.

Definition: network.h:2080

TNEANet::GetRndEId

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

Returns an ID of a random edge in the graph.

Definition: network.h:2089

Here is the call graph for this function:

int TNEANet::GetRndEId ( TRnd & Rnd = TInt::Rnd )

inline

Returns an ID of a random edge in the graph.

Definition at line 2089 of file network.h.

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

2089 { return EdgeH.GetKey(EdgeH.GetRndKeyId(Rnd, 0.8)); }

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

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

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:210

Here is the call graph for this function:

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

inline

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

Definition at line 2087 of file network.h.

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

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

TNEANet::GetRndNId

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

Returns an ID of a random node in the graph.

Definition: network.h:2085

TNEANet::GetNI

TNodeI GetNI(const int &NId) const

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

Definition: network.h:1912

Here is the call graph for this function:

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

inline

Returns an ID of a random node in the graph.

Definition at line 2085 of file network.h.

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

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

THash< TInt, TNode > NodeH

Definition: network.h:1829

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

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:210

Here is the call graph for this function:

PNEANet TNEANet::GetSmallGraph ( )

static

Returns a small multigraph on 5 nodes and 6 edges.

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

Definition at line 988 of file network.cpp.

References New().

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

Here is the call graph for this function:

TStr TNEANet::GetStrAttrDatE	(	const TEdgeI &	EdgeId,
		const TStr &	attr
	)

inline

Gets the value of str attr from the edge attr value vector.

Definition at line 2176 of file network.h.

References TNEANet::TEdgeI::GetId(), and GetStrAttrDatE().

Referenced by GetStrAttrDatE().

2176 { return GetStrAttrDatE(EdgeId.GetId(), attr); }

TNEANet::GetStrAttrDatE

TStr GetStrAttrDatE(const TEdgeI &EdgeId, const TStr &attr)

Gets the value of str attr from the edge attr value vector.

Definition: network.h:2176

Here is the call graph for this function:

Here is the caller graph for this function:

TStr TNEANet::GetStrAttrDatE	(	const int &	EId,
		const TStr &	attr
	)

Definition at line 786 of file network.cpp.

References EdgeH, THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeE, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsE.

                                                              {
   return VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)];
 }

Here is the call graph for this function:

TStr TNEANet::GetStrAttrDatN	(	const TNodeI &	NodeId,
		const TStr &	attr
	)

inline

Gets the value of str attr from the node attr value vector.

Definition at line 2160 of file network.h.

References TNEANet::TNodeI::GetId(), and GetStrAttrDatN().

Referenced by GetStrAttrDatN().

2160 { return GetStrAttrDatN(NodeId.GetId(), attr); }

TNEANet::GetStrAttrDatN

TStr GetStrAttrDatN(const TNodeI &NodeId, const TStr &attr)

Gets the value of str attr from the node attr value vector.

Definition: network.h:2160

Here is the call graph for this function:

Here is the caller graph for this function:

TStr TNEANet::GetStrAttrDatN	(	const int &	NId,
		const TStr &	attr
	)

Definition at line 766 of file network.cpp.

References THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), KeyToIndexTypeN, NodeH, TPair< TVal1, TVal2 >::Val2, and VecOfStrVecsN.

                                                              {
   return VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)];
 }

Here is the call graph for this function:

TStr TNEANet::GetStrAttrDefaultE ( const TStr & attribute ) const

inlineprivate

Get Str edge attribute val. If not a proper attr, return default.

Definition at line 1822 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), TStr::GetNullStr(), THash< TKey, TDat, THashFunc >::IsKey(), and StrDefaultsE.

Referenced by AddEdge(), AddStrAttrDatE(), DelAttrDatE(), and EdgeAttrIsStrDeleted().

1822 { return StrDefaultsE.IsKey(attribute) ? StrDefaultsE.GetDat(attribute) : (TStr) TStr::GetNullStr(); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStr::GetNullStr

static TStr GetNullStr()

Definition: dt.cpp:1626

TNEANet::StrDefaultsE

THash< TStr, TStr > StrDefaultsE

Definition: network.h:1835

TStr

Definition: dt.h:412

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

Here is the caller graph for this function:

TStr TNEANet::GetStrAttrDefaultN ( const TStr & attribute ) const

inlineprivate

Get Str node attribute val. If not a proper attr, return default.

Definition at line 1816 of file network.h.

References THash< TKey, TDat, THashFunc >::GetDat(), TStr::GetNullStr(), THash< TKey, TDat, THashFunc >::IsKey(), and StrDefaultsN.

Referenced by AddNode(), AddStrAttrDatN(), DelAttrDatN(), and NodeAttrIsStrDeleted().

1816 { return StrDefaultsN.IsKey(attribute) ? StrDefaultsN.GetDat(attribute) : (TStr) TStr::GetNullStr(); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TNEANet::StrDefaultsN

THash< TStr, TStr > StrDefaultsN

Definition: network.h:1835

TStr::GetNullStr

static TStr GetNullStr()

Definition: dt.cpp:1626

TStr

Definition: dt.h:412

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 3 of file network.cpp.

References HasGraphFlag.

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

void TNEANet::IntAttrNameEI	(	const TInt &	EId,
		TStrV &	Names
	)		const

inline

Returns a vector of int attr names for edge EId.

Definition at line 1984 of file network.h.

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

1984 {

1985 IntAttrNameEI(EId, KeyToIndexTypeE.BegI(), Names);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::IntAttrNameEI

void IntAttrNameEI(const TInt &EId, TStrV &Names) const

Returns a vector of int attr names for edge EId.

Definition: network.h:1984

Here is the call graph for this function:

void TNEANet::IntAttrNameEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TStrV &	Names
	)		const

Definition at line 167 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsIntDeleted(), THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), IntType, and THashKeyDatI< TKey, TDat >::IsEnd().

                                                                                        {
   Names = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == IntType && !EdgeAttrIsIntDeleted(EId, EdgeHI)) {
       Names.Add(EdgeHI.GetKey());
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::IntAttrNameNI	(	const TInt &	NId,
		TStrV &	Names
	)		const

inline

Returns a vector of int attr names for node NId.

Definition at line 1951 of file network.h.

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

1951 {

1952 IntAttrNameNI(NId, KeyToIndexTypeN.BegI(), Names);}

TIter BegI() const

Definition: hash.h:171

TNEANet::IntAttrNameNI

void IntAttrNameNI(const TInt &NId, TStrV &Names) const

Returns a vector of int attr names for node NId.

Definition: network.h:1951

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

Here is the call graph for this function:

void TNEANet::IntAttrNameNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TStrV &	Names
	)		const

Definition at line 45 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), IntType, THashKeyDatI< TKey, TDat >::IsEnd(), and NodeAttrIsIntDeleted().

                                                                                        {
   Names = TVec<TStr>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == IntType && !NodeAttrIsIntDeleted(NId, NodeHI)) {
       Names.Add(NodeHI.GetKey());
     }
     NodeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::IntAttrValueEI	(	const TInt &	EId,
		TIntV &	Values
	)		const

inline

Returns a vector of attr values for edge EId.

Definition at line 1988 of file network.h.

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

Referenced by Dump().

1988 {

1989 IntAttrValueEI(EId, KeyToIndexTypeE.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::IntAttrValueEI

void IntAttrValueEI(const TInt &EId, TIntV &Values) const

Returns a vector of attr values for edge EId.

Definition: network.h:1988

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::IntAttrValueEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TIntV &	Values
	)		const

Definition at line 177 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsIntDeleted(), THashKeyDatI< TKey, TDat >::GetDat(), IntType, THashKeyDatI< TKey, TDat >::IsEnd(), and VecOfIntVecsE.

                                                                                          {
   Values = TVec<TInt>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == IntType && !EdgeAttrIsIntDeleted(EId, EdgeHI)) {
       TInt val = (this->VecOfIntVecsE.GetVal(EdgeHI.GetDat().Val2).GetVal(EId));
       Values.Add(val);
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::IntAttrValueNI	(	const TInt &	NId,
		TIntV &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 1955 of file network.h.

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

Referenced by Dump().

1955 {

1956 IntAttrValueNI(NId, KeyToIndexTypeN.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

TNEANet::IntAttrValueNI

void IntAttrValueNI(const TInt &NId, TIntV &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:1955

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::IntAttrValueNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TIntV &	Values
	)		const

Definition at line 55 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), THashKeyDatI< TKey, TDat >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntType, THashKeyDatI< TKey, TDat >::IsEnd(), NodeAttrIsIntDeleted(), NodeH, and VecOfIntVecsN.

                                                                                          {
   Values = TVec<TInt>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == IntType && !NodeAttrIsIntDeleted(NId, NodeHI)) {
       TInt val = this->VecOfIntVecsN.GetVal(NodeHI.GetDat().Val2).GetVal(NodeH.GetKeyId(NId));
       Values.Add(val);
     }
     NodeHI++;
   }  
 }

Here is the call graph for this function:

bool TNEANet::IsEdge ( const int & EId ) const

inline

Tests whether an edge with edge ID EId exists in the graph.

Definition at line 2068 of file network.h.

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

Referenced by AddEdge(), AddFltAttrDatE(), AddIntAttrDatE(), AddStrAttrDatE(), DelEdge(), and IsOk().

2068 { return EdgeH.IsKey(EId); }

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::IsEdge	(	const int &	SrcNId,
		const int &	DstNId,
		const bool &	IsDir = `true`
	)		const

inline

Tests whether an edge between node IDs SrcNId and DstNId exists in the graph.

Definition at line 2070 of file network.h.

References IsEdge().

Referenced by IsEdge().

2070 { int EId; return IsEdge(SrcNId, DstNId, EId, IsDir); }

TNEANet::IsEdge

bool IsEdge(const int &EId) const

Tests whether an edge with edge ID EId exists in the graph.

Definition: network.h:2068

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::IsEdge	(	const int &	SrcNId,
		const int &	DstNId,
		int &	EId,
		const bool &	IsDir = `true`
	)		const

Tests whether an edge between node IDs SrcNId and DstNId exists in the graph. if an edge exists, return its edge ID in EId.

Definition at line 460 of file network.cpp.

References TNEANet::TEdge::GetDstNId(), GetEdge(), TNEANet::TEdge::GetId(), TNEANet::TNode::GetInDeg(), TNEANet::TNode::GetInEId(), GetNode(), TNEANet::TNode::GetOutDeg(), TNEANet::TNode::GetOutEId(), and TNEANet::TEdge::GetSrcNId().

                                                                                             {
   const TNode& SrcNode = GetNode(SrcNId);
   for (int edge = 0; edge < SrcNode.GetOutDeg(); edge++) {
     const TEdge& Edge = GetEdge(SrcNode.GetOutEId(edge));
     if (DstNId == Edge.GetDstNId()) {
       EId = Edge.GetId();
       return true;
     }
   }
   if (! IsDir) {
     for (int edge = 0; edge < SrcNode.GetInDeg(); edge++) {
       const TEdge& Edge = GetEdge(SrcNode.GetInEId(edge));
       if (DstNId == Edge.GetSrcNId()) {
         EId = Edge.GetId();
         return true;
       }
     }
   }
   return false;
 }

Here is the call graph for this function:

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

inline

Tests whether ID NId is a node.

Definition at line 1906 of file network.h.

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

Referenced by AddEdge(), AddFltAttrDatN(), AddIntAttrDatN(), AddNode(), AddStrAttrDatN(), and IsOk().

1906 { return NodeH.IsKey(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:1829

bool IsKey(const TKey &Key) const

Definition: hash.h:216

Here is the call graph for this function:

Here is the caller graph for this function:

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

Checks the graph data structure for internal consistency.

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

Definition at line 504 of file network.cpp.

References TStr::CStr(), EAssertR, EdgeH, ErrNotify(), THash< TKey, TDat, THashFunc >::FFirstKeyId(), TStr::Fmt(), THash< TKey, TDat, THashFunc >::FNextKeyId(), TNEANet::TEdge::GetDstNId(), TNEANet::TNode::GetId(), TNEANet::TEdge::GetId(), TNEANet::TNode::GetInDeg(), TNEANet::TNode::GetInEId(), TNEANet::TNode::GetOutDeg(), TNEANet::TNode::GetOutEId(), TNEANet::TEdge::GetSrcNId(), TNEANet::TNode::InEIdV, IsEdge(), IsNode(), TVec< TVal, TSizeTy >::IsSorted(), NodeH, and TNEANet::TNode::OutEIdV.

                                                 {
   bool RetVal = true;
   for (int N = NodeH.FFirstKeyId(); NodeH.FNextKeyId(N); ) {
     const TNode& Node = NodeH[N];
     if (! Node.OutEIdV.IsSorted()) {
       const TStr Msg = TStr::Fmt("Out-edge list of node %d is not sorted.", Node.GetId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
     }
     if (! Node.InEIdV.IsSorted()) {
       const TStr Msg = TStr::Fmt("In-edge list of node %d is not sorted.", Node.GetId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
     }
     // check out-edge ids
     int prevEId = -1;
     for (int e = 0; e < Node.GetOutDeg(); e++) {
       if (! IsEdge(Node.GetOutEId(e))) {
         const TStr Msg = TStr::Fmt("Out-edge id %d of node %d does not exist.",  Node.GetOutEId(e), Node.GetId());
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       if (e > 0 && prevEId == Node.GetOutEId(e)) {
         const TStr Msg = TStr::Fmt("Node %d has duplidate out-edge id %d.", Node.GetId(), Node.GetOutEId(e));
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       prevEId = Node.GetOutEId(e);
     }
     // check in-edge ids
     prevEId = -1;
     for (int e = 0; e < Node.GetInDeg(); e++) {
       if (! IsEdge(Node.GetInEId(e))) {
       const TStr Msg = TStr::Fmt("Out-edge id %d of node %d does not exist.",  Node.GetInEId(e), Node.GetId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       if (e > 0 && prevEId == Node.GetInEId(e)) {
         const TStr Msg = TStr::Fmt("Node %d has duplidate out-edge id %d.", Node.GetId(), Node.GetInEId(e));
         if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
       }
       prevEId = Node.GetInEId(e);
     }
   }
   for (int E = EdgeH.FFirstKeyId(); EdgeH.FNextKeyId(E); ) {
     const TEdge& Edge = EdgeH[E];
     if (! IsNode(Edge.GetSrcNId())) {
       const TStr Msg = TStr::Fmt("Edge %d source node %d does not exist.", Edge.GetId(), Edge.GetSrcNId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
     }
     if (! IsNode(Edge.GetDstNId())) {
       const TStr Msg = TStr::Fmt("Edge %d destination node %d does not exist.", Edge.GetId(), Edge.GetDstNId());
       if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
     }
   }
   return RetVal;
 }

Here is the call graph for this function:

static PNEANet TNEANet::Load ( TSIn & SIn )

inlinestatic

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

Definition at line 1882 of file network.h.

References TNEANet().

1882 { return PNEANet(new TNEANet(SIn)); }

TNEANet::TNEANet

TNEANet()

Definition: network.h:1842

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1566

Here is the call graph for this function:

static PNEANet TNEANet::New ( )

inlinestatic

Static cons returns pointer to graph. Ex: PNEANet Graph=TNEANet::New().

Definition at line 1876 of file network.h.

References TNEANet().

Referenced by GetSmallGraph().

1876 { return PNEANet(new TNEANet()); }

TNEANet::TNEANet

TNEANet()

Definition: network.h:1842

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1566

Here is the call graph for this function:

Here is the caller graph for this function:

static PNEANet TNEANet::New	(	const int &	Nodes,
		const int &	Edges
	)

inlinestatic

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

Call: PNEANet Graph = TNEANet::New(Nodes, Edges).

Definition at line 1880 of file network.h.

References TNEANet().

1880 { return PNEANet(new TNEANet(Nodes, Edges)); }

TNEANet::TNEANet

TNEANet()

Definition: network.h:1842

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1566

Here is the call graph for this function:

bool TNEANet::NodeAttrIsDeleted	(	const int &	NId,
		const TStrIntPrH::TIter &	NodeHI
	)		const

Definition at line 108 of file network.cpp.

References NodeAttrIsFltDeleted(), NodeAttrIsIntDeleted(), and NodeAttrIsStrDeleted().

Referenced by AttrNameNI(), and AttrValueNI().

                                                                                    {
   bool IntDel = NodeAttrIsIntDeleted(NId, NodeHI);
   bool StrDel = NodeAttrIsStrDeleted(NId, NodeHI);
   bool FltDel = NodeAttrIsFltDeleted(NId, NodeHI);
   return IntDel || StrDel || FltDel;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::NodeAttrIsFltDeleted	(	const int &	NId,
		const TStrIntPrH::TIter &	NodeHI
	)		const

Definition at line 127 of file network.cpp.

References FltType, THashKeyDatI< TKey, TDat >::GetDat(), GetFltAttrDefaultN(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), NodeH, and VecOfFltVecsN.

Referenced by FltAttrNameNI(), FltAttrValueNI(), and NodeAttrIsDeleted().

                                                                                       {
   return (NodeHI.GetDat().Val1 == FltType &&
     GetFltAttrDefaultN(NodeHI.GetKey()) == this->VecOfFltVecsN.GetVal(
     this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId)));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::NodeAttrIsIntDeleted	(	const int &	NId,
		const TStrIntPrH::TIter &	NodeHI
	)		const

Definition at line 115 of file network.cpp.

References THashKeyDatI< TKey, TDat >::GetDat(), GetIntAttrDefaultN(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntType, NodeH, and VecOfIntVecsN.

Referenced by IntAttrNameNI(), IntAttrValueNI(), and NodeAttrIsDeleted().

                                                                                       {
   return (NodeHI.GetDat().Val1 == IntType &&
     GetIntAttrDefaultN(NodeHI.GetKey()) == this->VecOfIntVecsN.GetVal(
     this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId)));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::NodeAttrIsStrDeleted	(	const int &	NId,
		const TStrIntPrH::TIter &	NodeHI
	)		const

Definition at line 121 of file network.cpp.

References THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetStrAttrDefaultN(), NodeH, StrType, and VecOfStrVecsN.

Referenced by NodeAttrIsDeleted(), StrAttrNameNI(), and StrAttrValueNI().

                                                                                       {
   return (NodeHI.GetDat().Val1 == StrType &&
     GetStrAttrDefaultN(NodeHI.GetKey()) == this->VecOfStrVecsN.GetVal(
     this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId)));
 }

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

Definition at line 1885 of file network.h.

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

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

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

inline

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

Definition at line 2106 of file network.h.

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

2106 {

2107 if (Nodes>0) { NodeH.Gen(Nodes/2); } if (Edges>0) { EdgeH.Gen(Edges/2); } }

THash< TInt, TEdge > EdgeH

Definition: network.h:1830

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:180

THash< TInt, TNode > NodeH

Definition: network.h:1829

Here is the call graph for this function:

void TNEANet::Save ( TSOut & SOut ) const

inline

Saves the graph to a (binary) stream SOut.

Definition at line 1866 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, FltDefaultsE, FltDefaultsN, IntDefaultsE, IntDefaultsN, KeyToIndexTypeE, KeyToIndexTypeN, TNodeEdgeNet< TNodeData, TEdgeData >::MxEId, TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, TNodeEdgeNet< TNodeData, TEdgeData >::NodeH, THash< TKey, TDat, THashFunc >::Save(), TInt::Save(), StrDefaultsE, StrDefaultsN, VecOfFltVecsE, VecOfFltVecsN, VecOfIntVecsE, VecOfIntVecsN, VecOfStrVecsE, and VecOfStrVecsN.

                                {
     MxNId.Save(SOut); MxEId.Save(SOut); NodeH.Save(SOut); EdgeH.Save(SOut);
     KeyToIndexTypeN.Save(SOut); KeyToIndexTypeE.Save(SOut);
     IntDefaultsN.Save(SOut); IntDefaultsE.Save(SOut);
     StrDefaultsN.Save(SOut); StrDefaultsE.Save(SOut);
     FltDefaultsN.Save(SOut); FltDefaultsE.Save(SOut);
     VecOfIntVecsN.Save(SOut); VecOfIntVecsE.Save(SOut);
     VecOfStrVecsN.Save(SOut); VecOfStrVecsE.Save(SOut);
     VecOfFltVecsN.Save(SOut); VecOfFltVecsE.Save(SOut); }

Here is the call graph for this function:

void TNEANet::StrAttrNameEI	(	const TInt &	EId,
		TStrV &	Names
	)		const

inline

Returns a vector of str attr names for node NId.

Definition at line 1992 of file network.h.

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

1992 {

1993 StrAttrNameEI(EId, KeyToIndexTypeE.BegI(), Names);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::StrAttrNameEI

void StrAttrNameEI(const TInt &EId, TStrV &Names) const

Returns a vector of str attr names for node NId.

Definition: network.h:1992

Here is the call graph for this function:

void TNEANet::StrAttrNameEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TStrV &	Names
	)		const

Definition at line 188 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsStrDeleted(), THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THashKeyDatI< TKey, TDat >::IsEnd(), and StrType.

                                                                                        {
   Names = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == StrType && !EdgeAttrIsStrDeleted(EId, EdgeHI)) {
       Names.Add(EdgeHI.GetKey());
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::StrAttrNameNI	(	const TInt &	NId,
		TStrV &	Names
	)		const

inline

Returns a vector of str attr names for node NId.

Definition at line 1959 of file network.h.

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

1959 {

1960 StrAttrNameNI(NId, KeyToIndexTypeN.BegI(), Names);}

TNEANet::StrAttrNameNI

void StrAttrNameNI(const TInt &NId, TStrV &Names) const

Returns a vector of str attr names for node NId.

Definition: network.h:1959

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

KeyToIndexType[N|E]: Key->(Type,Index).

Definition: network.h:1832

Here is the call graph for this function:

void TNEANet::StrAttrNameNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TStrV &	Names
	)		const

Definition at line 66 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THashKeyDatI< TKey, TDat >::IsEnd(), NodeAttrIsStrDeleted(), and StrType.

                                                                                        {
   Names = TVec<TStr>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == StrType && !NodeAttrIsStrDeleted(NId, NodeHI)) {
       Names.Add(NodeHI.GetKey());
     }
     NodeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::StrAttrValueEI	(	const TInt &	EId,
		TStrV &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 1996 of file network.h.

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

Referenced by Dump().

1996 {

1997 StrAttrValueEI(EId, KeyToIndexTypeE.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1832

TNEANet::StrAttrValueEI

void StrAttrValueEI(const TInt &EId, TStrV &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:1996

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::StrAttrValueEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TStrV &	Values
	)		const

Definition at line 198 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), EdgeAttrIsStrDeleted(), THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::IsEnd(), StrType, and VecOfStrVecsE.

                                                                                          {
   Values = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == StrType && !EdgeAttrIsStrDeleted(EId, EdgeHI)) {
       TStr val = this->VecOfStrVecsE.GetVal(EdgeHI.GetDat().Val2).GetVal(EId);
       Values.Add(val);
     }
     EdgeHI++;
   }  
 }

Here is the call graph for this function:

void TNEANet::StrAttrValueNI	(	const TInt &	NId,
		TStrV &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 1963 of file network.h.

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

Referenced by Dump().

1963 {

1964 StrAttrValueNI(NId, KeyToIndexTypeN.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TNEANet::StrAttrValueNI

void StrAttrValueNI(const TInt &NId, TStrV &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:1963