SNAP Library 3.0, User Reference: TNEANet Class Reference

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

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

Definition at line 207 of file network.cpp.

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

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

inline

Returns a vector of attr names for node NId.

Definition at line 2034 of file network.h.

2034 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

TNEANet::AttrNameNI

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

Returns a vector of attr names for node NId.

Definition: network.h:2034

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

Definition at line 25 of file network.cpp.

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

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2084 of file network.h.

2084 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::AttrValueEI

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

Returns a vector of attr values for edge EId.

Definition: network.h:2084

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

Definition at line 217 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2038 of file network.h.

2038 {

2039 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:2038

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

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

Definition at line 35 of file network.cpp.

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

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

inline

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

Definition at line 2162 of file network.h.

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

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

inline

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

Definition at line 2125 of file network.h.

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

TAIntVI TNEANet::BegEAIntVI ( const TStr & attr ) const

inline

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

Definition at line 2138 of file network.h.

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

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

inline

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

Definition at line 2151 of file network.h.

2151 {

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

TNEANet::VecOfStrVecsE

TVec< TStrV > VecOfStrVecsE

Definition: network.h:1871

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TVal2 Val2

Definition: ds.h:35

TEdgeI TNEANet::BegEI ( ) const

inline

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

Definition at line 2206 of file network.h.

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

TIter BegI() const

Definition: hash.h:171

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

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

inline

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

Definition at line 2024 of file network.h.

2024 {

2025 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:1865

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:1872

TVal2 Val2

Definition: ds.h:35

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

inline

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

Definition at line 1993 of file network.h.

1993 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:1870

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

TVec::BegI

TIter BegI() const

Returns an iterator pointing to the first element in the vector.

Definition: ds.h:565

TVal2 Val2

Definition: ds.h:35

TAIntVI TNEANet::BegNAIntVI ( const TStr & attr ) const

inline

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

Definition at line 2003 of file network.h.

2003 {

2004 return TAIntVI(VecOfIntVecVecsN[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:1865

TNEANet::VecOfIntVecVecsN

TVal2 Val2

Definition: ds.h:35

TVec< TVec< TIntV > > VecOfIntVecVecsN

Definition: network.h:1873

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

inline

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

Definition at line 2014 of file network.h.

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

TNodeI TNEANet::BegNI ( ) const

inline

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

Definition at line 1987 of file network.h.

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

TIter BegI() const

Definition: hash.h:171

TNEANet::DelFromIntVAttrDatN

THash< TInt, TNode > NodeH

Definition: network.h:1862

void TNEANet::Clr ( )

inline

Deletes all nodes and edges from the graph.

Definition at line 2230 of file network.h.

              { 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(); VecOfIntVecVecsN.Clr(); VecOfIntVecVecsE.Clr(); 
     SAttrN.Clr(); SAttrE.Clr();}

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

                                               {
   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(); }
 }

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

inline

Deletes the edge attribute for NodeI.

Definition at line 2374 of file network.h.

2374 { return DelAttrDatE(EdgeI.GetId(), attr); }

TNEANet::DelAttrDatE

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

Deletes the edge attribute for NodeI.

Definition: network.h:2374

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

Definition at line 1126 of file network.cpp.

                                                          {
   // 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 if (vecType == IntVType) {
     VecOfIntVecVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = TIntV();
   } else {
     return -1;
   }
   return 0;
 }

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

inline

Deletes the node attribute for NodeI.

Definition at line 2371 of file network.h.

2371 { return DelAttrDatN(NodeI.GetId(), attr); }

TNEANet::DelAttrDatN

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

Deletes the node attribute for NodeI.

Definition: network.h:2371

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

Definition at line 1110 of file network.cpp.

                                                          {
   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 if (vecType ==IntVType) {
     VecOfIntVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = TIntV();
   } else {
     return -1;
   }
   return 0;
 }

int TNEANet::DelAttrE ( const TStr & attr )

Removes all the values for edge attr.

Definition at line 1309 of file network.cpp.

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

int TNEANet::DelAttrN ( const TStr & attr )

Removes all the values for node attr.

Definition at line 1283 of file network.cpp.

                                       {
   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 if (vecType == IntVType) {
     VecOfIntVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TIntV>();
   } else {
     return -1;
   }
   KeyToIndexTypeN.DelKey(attr);
   return 0;
 }

void TNEANet::DelEdge ( const int & EId )

Deletes an edge with edge ID EId from the graph.

Definition at line 594 of file network.cpp.

                                     {
   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);
   TInt Id(EId);
   SAttrE.DelSAttrId(Id);
 
   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);
 }

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

                                                                              {
   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);
   }
 }

int TNEANet::DelFromIntVAttrDatN	(	const TNodeI &	NodeI,
		const TInt &	value,
		const TStr &	attr
	)

inline

Deletes value from the TIntV attribute for the given node.

Definition at line 2278 of file network.h.

2278 { return DelFromIntVAttrDatN(NodeI.GetId(), value, attr); }

int DelFromIntVAttrDatN(const TNodeI &NodeI, const TInt &value, const TStr &attr)

Deletes value from the TIntV attribute for the given node.

Definition: network.h:2278

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

Definition at line 858 of file network.cpp.

                                                                                     {
   TInt CurrLen;
   if (!IsNode(NId)) {
     // AddNode(NId);
     return -1;
   }
   if (KeyToIndexTypeN.IsKey(attr)) {
     TVec<TIntV>& NewVec = VecOfIntVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2];
     if (!NewVec[NodeH.GetKeyId(NId)].DelIfIn(value)) {
       return -1;
     }
   } else {
     return -1;
   }
   return 0;
 } 

void TNEANet::DelNode ( const int & NId )

virtual

Deletes node of ID NId from the graph.

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

Reimplemented in TModeNet.

Definition at line 451 of file network.cpp.

                                     {
   int i;
   TInt Id(NId);
   SAttrN.DelSAttrId(Id);
   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;
     }
     for (i = 0; i < VecOfIntVecVecsE.Len(); i++) {
       TVec<TIntV>& IntVecV = VecOfIntVecVecsE[i];
       IntVecV[EdgeH.GetKeyId(EId)] = TIntV();
     }
     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;
     }
     for (i = 0; i < VecOfIntVecVecsE.Len(); i++) {
       TVec<TIntV>& IntVecV = VecOfIntVecVecsE[i];
       IntVecV[EdgeH.GetKeyId(EId)] = TIntV();
     }
     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;
   }
   for (i = 0; i < VecOfIntVecVecsN.Len(); i++) {
     TVec<TIntV>& IntVecV = VecOfIntVecVecsN[i];
     IntVecV[NodeH.GetKeyId(NId)] = TIntV();
   }
   NodeH.DelKey(NId);
 }

void TNEANet::DelNode ( const TNode & NodeI )

inline

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

Definition at line 1983 of file network.h.

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

TNEANet::DelNode

virtual void DelNode(const int &NId)

Deletes node of ID NId from the graph.

Definition: network.cpp:451

int TNEANet::DelSAttrDatE	(	const TInt &	EId,
		const TStr &	AttrName
	)

Deletes sparse attribute with name AttrName from edge with id EId.

Definition at line 1615 of file network.cpp.

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

int TNEANet::DelSAttrDatE	(	const TInt &	EId,
		const TInt &	AttrId
	)

Deletes sparse attribute with id AttrId from edge with id EId.

Definition at line 1622 of file network.cpp.

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

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

inline

Deletes sparse attribute with name AttrName from EdgeI.

Definition at line 2678 of file network.h.

                                                               {
     return DelSAttrDatE(EdgeI.GetId(), AttrName);
   }

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

inline

Deletes sparse attribute with id AttrId from EdgeI.

Definition at line 2682 of file network.h.

                                                             {
     return DelSAttrDatE(EdgeI.GetId(), AttrId);
   } 

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

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

Definition at line 1489 of file network.cpp.

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

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

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

Definition at line 1496 of file network.cpp.

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

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

inline

Deletes sparse attribute with name AttrName from NodeI.

Definition at line 2560 of file network.h.

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

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

inline

Deletes sparse attribute with id AttrId from NodeI.

Definition at line 2564 of file network.h.

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

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

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

Definition at line 729 of file network.cpp.

                                    {
   const int NodePlaces = (int) ceil(log10((double) GetNodes()));
   const int EdgePlaces = (int) ceil(log10((double) GetEdges()));
   fprintf(OutF, "-------------------------------------------------\nDirected Node-Edge Network with Attributes: nodes: %d, edges: %d\n", GetNodes(), GetEdges());
   for (TNodeI NodeI = BegNI(); NodeI < EndNI(); NodeI++) {
     fprintf(OutF, "  %*d:", NodePlaces, NodeI.GetId());
     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");
 
     // 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]()); }
     //fprintf(OutF, "\n");
 
     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]()); }
     //fprintf(OutF, "\n");
 
     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, "\n");
     fprintf(OutF, "\n");
   }
   for (TEdgeI EdgeI = BegEI(); EdgeI < EndEI(); EdgeI++) {
     fprintf(OutF, "  %*d:  %*d  ->  %*d", 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");
   }
   //fprintf(OutF, "\n");
 }

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

Returns true if EId attr deleted for current edge attr iterator.

Definition at line 335 of file network.cpp.

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

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

Returns true if EId attr deleted for current edge flt attr iterator.

Definition at line 361 of file network.cpp.

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

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

Returns true if EId attr deleted for current edge int attr iterator.

Definition at line 343 of file network.cpp.

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

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

Returns true if EId attr deleted for current edge int vector attr iterator.

Definition at line 349 of file network.cpp.

                                                                                        {
   return (EdgeHI.GetDat().Val1 == IntVType &&
     TIntV() == this->VecOfIntVecVecsE.GetVal(
     this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId)));
 }

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

Returns true if EId attr deleted for current edge str attr iterator.

Definition at line 355 of file network.cpp.

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

bool TNEANet::Empty ( ) const

inline

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

Definition at line 2228 of file network.h.

2228 { return GetNodes()==0; }

TNEANet::GetNodes

int GetNodes() const

Returns the number of nodes in the graph.

Definition: network.h:1969

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

inline

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

Definition at line 2166 of file network.h.

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

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

inline

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

Definition at line 2129 of file network.h.

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

TAIntVI TNEANet::EndEAIntVI ( const TStr & attr ) const

inline

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

Definition at line 2142 of file network.h.

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

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

inline

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

Definition at line 2154 of file network.h.

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

TEdgeI TNEANet::EndEI ( ) const

inline

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

Definition at line 2208 of file network.h.

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

THash::EndI

TIter EndI() const

Definition: hash.h:176

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

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

inline

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

Definition at line 2027 of file network.h.

2027 {

2028 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:1865

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:1872

TVal2 Val2

Definition: ds.h:35

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

inline

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

Definition at line 1996 of file network.h.

1996 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:1870

TVec::EndI

TIter EndI() const

Returns an iterator referring to the past-the-end element in the vector.

Definition: ds.h:567

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

TVal2 Val2

Definition: ds.h:35

TAIntVI TNEANet::EndNAIntVI ( const TStr & attr ) const

inline

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

Definition at line 2006 of file network.h.

2006 {

2007 return TAIntVI(VecOfIntVecVecsN[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:1865

TNEANet::VecOfIntVecVecsN

TVal2 Val2

Definition: ds.h:35

TVec< TVec< TIntV > > VecOfIntVecVecsN

Definition: network.h:1873

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

inline

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

Definition at line 2018 of file network.h.

2018 {

2019 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:1871

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

TVal2 Val2

Definition: ds.h:35

TNodeI TNEANet::EndNI ( ) const

inline

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

Definition at line 1989 of file network.h.

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

THash::EndI

TIter EndI() const

Definition: hash.h:176

THash< TInt, TNode > NodeH

Definition: network.h:1862

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2116 of file network.h.

2116 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::FltAttrNameEI

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

Returns a vector of int attr names for node NId.

Definition: network.h:2116

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

Definition at line 290 of file network.cpp.

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

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2071 of file network.h.

2071 {

2072 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:2071

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

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

Definition at line 108 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2120 of file network.h.

2120 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::FltAttrValueEI

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

Returns a vector of attr values for node NId.

Definition: network.h:2120

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

Definition at line 300 of file network.cpp.

                                                                                          {
   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++;
   }  
 }

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

inline

Returns a vector of attr values for node NId.

Definition at line 2075 of file network.h.

2075 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

TNEANet::FltAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2075

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

Definition at line 118 of file network.cpp.

                                                                                          {
   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++;
   }  
 }

void TNEANet::GetAttrENames	(	TStrV &	IntAttrNames,
		TStrV &	FltAttrNames,
		TStrV &	StrAttrNames
	)		const

Fills each of the vectors with the names of edge attributes of the given type.

Definition at line 1357 of file network.cpp.

                                                                                                {
   for (TStrIntPrH::TIter it = KeyToIndexTypeE.BegI(); it < KeyToIndexTypeE.EndI(); it++) {
     if (it.GetDat().GetVal1() == IntType) {
       IntAttrNames.Add(it.GetKey());
     }
     if (it.GetDat().GetVal1() == FltType) {
       FltAttrNames.Add(it.GetKey());
     }
     if (it.GetDat().GetVal1() == StrType) {
       StrAttrNames.Add(it.GetKey());
     }
   }
 }

int TNEANet::GetAttrIndE ( const TStr & attr )

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

Definition at line 1106 of file network.cpp.

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

int TNEANet::GetAttrIndN ( const TStr & attr )

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

Definition at line 1070 of file network.cpp.

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

void TNEANet::GetAttrNNames	(	TStrV &	IntAttrNames,
		TStrV &	FltAttrNames,
		TStrV &	StrAttrNames
	)		const

Fills each of the vectors with the names of node attributes of the given type.

Definition at line 1343 of file network.cpp.

                                                                                                {
   for (TStrIntPrH::TIter it = KeyToIndexTypeN.BegI(); it < KeyToIndexTypeN.EndI(); it++) {
     if (it.GetDat().GetVal1() == IntType) {
       IntAttrNames.Add(it.GetKey());
     }
     if (it.GetDat().GetVal1() == FltType) {
       FltAttrNames.Add(it.GetKey());
     }
     if (it.GetDat().GetVal1() == StrType) {
       StrAttrNames.Add(it.GetKey());
     }
   }
 }

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

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

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

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

TAIntVI TNEANet::GetEAIntVI	(	const TStr &	attr,
		const int &	EId
	)		const

inline

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

Definition at line 2146 of file network.h.

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

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

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

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

inlineprotected

Definition at line 1842 of file network.h.

1842 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

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

inlineprotected

Definition at line 1843 of file network.h.

1843 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

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

Returns edge attribute value, converted to Str type.

Definition at line 367 of file network.cpp.

                                                                                   {
   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();
 }

int TNEANet::GetEdges ( ) const

inline

Returns the number of edges in the graph.

Definition at line 2179 of file network.h.

2179 { return EdgeH.Len(); }

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

THash::Len

int Len() const

Definition: hash.h:186

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

inline

Returns an iterator referring to edge with edge ID EId.

Definition at line 2210 of file network.h.

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

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:178

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

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

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

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

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

void TNEANet::GetEIdV ( TIntV & EIdV ) const

Gets a vector IDs of all edges in the graph.

Definition at line 660 of file network.cpp.

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

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

inline

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

Definition at line 2344 of file network.h.

2344 { return GetFltAttrDatE(EdgeI.GetId(), attr); }

TNEANet::GetFltAttrDatE

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

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

Definition: network.h:2344

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

Definition at line 1086 of file network.cpp.

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

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

inline

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

Definition at line 2311 of file network.h.

2311 { return GetFltAttrDatN(NodeI.GetId(), attr); }

TNEANet::GetFltAttrDatN

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

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

Definition: network.h:2311

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

Definition at line 1050 of file network.cpp.

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

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

inlineprotected

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

Definition at line 1857 of file network.h.

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

TNEANet::FltDefaultsE

THash< TStr, TFlt > FltDefaultsE

Definition: network.h:1869

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TFlt

Definition: dt.h:1293

bool IsKey(const TKey &Key) const

Definition: hash.h:216

TFlt::Mn

static const double Mn

Definition: dt.h:1297

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

inlineprotected

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

Definition at line 1851 of file network.h.

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

TNEANet::FltDefaultsN

THash< TStr, TFlt > FltDefaultsN

Definition: network.h:1869

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TFlt

Definition: dt.h:1293

TNEANet::GetFltAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:216

TFlt::Mn

static const double Mn

Definition: dt.h:1297

TFlt TNEANet::GetFltAttrIndDatE	(	const TEdgeI &	EdgeI,
		const int &	index
	)

inline

Gets the value of a float edge attr specified by edge iterator EdgeI and the attr index.

Definition at line 2361 of file network.h.

2361 { return GetFltAttrIndDatE(EdgeI.GetId(), index); }

TFlt GetFltAttrIndDatE(const TEdgeI &EdgeI, const int &index)

Gets the value of a float edge attr specified by edge iterator EdgeI and the attr index...

Definition: network.h:2361

TFlt TNEANet::GetFltAttrIndDatE	(	const int &	EId,
		const int &	index
	)

Gets the value of an int edge attr specified by edge ID EId and the attr index.

Definition at line 1098 of file network.cpp.

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

TFlt TNEANet::GetFltAttrIndDatN	(	const TNodeI &	NodeI,
		const int &	index
	)

inline

Gets the value of a float node attr specified by node iterator NodeI and the attr index.

Definition at line 2333 of file network.h.

2333 { return GetFltAttrIndDatN(NodeI.GetId(), index); }

TNEANet::GetFltAttrIndDatN

TFlt GetFltAttrIndDatN(const TNodeI &NodeI, const int &index)

Gets the value of a float node attr specified by node iterator NodeI and the attr index...

Definition: network.h:2333

TFlt TNEANet::GetFltAttrIndDatN	(	const int &	NId,
		const int &	index
	)

Gets the value of a float node attr specified by node ID NId and the attr index.

Definition at line 1062 of file network.cpp.

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

TVec< TFlt > & TNEANet::GetFltAttrVecE ( const TStr & attr )

Gets Vector for the Flt Attribute attr.

Definition at line 1030 of file network.cpp.

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

int TNEANet::GetFltKeyIdE ( const int & EId )

Gets keyid for edge with id EId.

Definition at line 1034 of file network.cpp.

                                         {
   return EdgeH.GetKeyId(EId);
 }

int TNEANet::GetIdVSAttrE	(	const TStr &	AttrName,
		TIntV &	IdV
	)		const

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

Definition at line 1637 of file network.cpp.

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

int TNEANet::GetIdVSAttrE	(	const TInt &	AttrId,
		TIntV &	IdV
	)		const

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

Definition at line 1641 of file network.cpp.

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

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

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

Definition at line 1511 of file network.cpp.

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

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

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

Definition at line 1515 of file network.cpp.

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

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

inline

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

Definition at line 2338 of file network.h.

2338 { return GetIntAttrDatE(EdgeI.GetId(), attr); }

TNEANet::GetIntAttrDatE

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

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

Definition: network.h:2338

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

Definition at line 1074 of file network.cpp.

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

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

inline

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

Definition at line 2304 of file network.h.

2304 { return GetIntAttrDatN(NodeI.GetId(), attr); }

TNEANet::GetIntAttrDatN

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

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

Definition: network.h:2304

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

Definition at line 1038 of file network.cpp.

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

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

inlineprotected

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

Definition at line 1853 of file network.h.

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

TNEANet::IntDefaultsE

THash< TStr, TInt > IntDefaultsE

Definition: network.h:1867

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TInt::Mn

static const int Mn

Definition: dt.h:1048

TInt

Definition: dt.h:1044

bool IsKey(const TKey &Key) const

Definition: hash.h:216

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

inlineprotected

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

Definition at line 1847 of file network.h.

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

TInt

Definition: dt.h:1044

TNEANet::IntDefaultsN

THash< TStr, TInt > IntDefaultsN

Definition: network.h:1867

TNEANet::GetIntAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:216

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

inline

Gets the value of an int edge attr specified by edge iterator EdgeI and the attr index.

Definition at line 2356 of file network.h.

2356 { return GetIntAttrIndDatE(EdgeI.GetId(), index); }

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

Gets the value of an int edge attr specified by edge iterator EdgeI and the attr index.

Definition: network.h:2356

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

Gets the value of an int edge attr specified by edge ID EId and the attr index.

Definition at line 1090 of file network.cpp.

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

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

inline

Gets the value of an int node attr specified by node iterator NodeI and the attr index.

Definition at line 2323 of file network.h.

2323 { return GetIntAttrIndDatN(NodeI.GetId(), index); }

TNEANet::GetIntAttrIndDatN

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

Gets the value of an int node attr specified by node iterator NodeI and the attr index.

Definition: network.h:2323

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

Gets the value of an int node attr specified by node ID NId and the attr index.

Definition at line 1054 of file network.cpp.

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

int TNEANet::GetIntAttrIndE ( const TStr & attr )

Gets the index of the edge attr value vector specified by attr (same as GetAttrIndE for compatibility reasons).

Definition at line 1102 of file network.cpp.

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

int TNEANet::GetIntAttrIndN ( const TStr & attr )

Gets the index of the node attr value vector specified by attr (same as GetAttrIndN for compatibility reasons).

Definition at line 1066 of file network.cpp.

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

TIntV TNEANet::GetIntVAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	attr
	)

inline

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

Definition at line 2347 of file network.h.

2347 { return GetIntVAttrDatE(EdgeI.GetId(), attr); }

TNEANet::GetIntVAttrDatE

TIntV GetIntVAttrDatE(const TEdgeI &EdgeI, const TStr &attr)

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

Definition: network.h:2347

TIntV TNEANet::GetIntVAttrDatE	(	const int &	EId,
		const TStr &	attr
	)

Definition at line 1078 of file network.cpp.

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

TIntV TNEANet::GetIntVAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	attr
	)		const

inline

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

Definition at line 2314 of file network.h.

2314 { return GetIntVAttrDatN(NodeI.GetId(), attr); }

TNEANet::GetIntVAttrDatN

TIntV GetIntVAttrDatN(const TNodeI &NodeI, const TStr &attr) const

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

Definition: network.h:2314

TIntV TNEANet::GetIntVAttrDatN	(	const int &	NId,
		const TStr &	attr
	)		const

Definition at line 1042 of file network.cpp.

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

int TNEANet::GetMxEId ( ) const

inline

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

Definition at line 2176 of file network.h.

2176 { return MxEId; }

TNEANet::MxEId

TInt MxEId

Definition: network.h:1861

int TNEANet::GetMxNId ( ) const

inline

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

Definition at line 2174 of file network.h.

2174 { return MxNId; }

TNEANet::MxNId

TInt MxNId

Definition: network.h:1861

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

2030 {

2031 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:1865

int GetKeyId(const TKey &Key) const

Definition: hash.h:424

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:1872

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:1862

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

1999 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:1870

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

int GetKeyId(const TKey &Key) const

Definition: hash.h:424

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:1862

TVec::GetI

TIter GetI(const TSizeTy &ValN) const

Returns an iterator an element at position ValN.

Definition: ds.h:569

TAIntVI TNEANet::GetNAIntVI	(	const TStr &	attr,
		const int &	NId
	)		const

inline

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

Definition at line 2009 of file network.h.

2009 {

2010 return TAIntVI(VecOfIntVecVecsN[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:1865

int GetKeyId(const TKey &Key) const

Definition: hash.h:424

TVal2 Val2

Definition: ds.h:35

TNEANet::VecOfIntVecVecsN

THash< TInt, TNode > NodeH

Definition: network.h:1862

TVec< TVec< TIntV > > VecOfIntVecVecsN

Definition: network.h:1873

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

2021 {

2022 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:1871

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

int GetKeyId(const TKey &Key) const

Definition: hash.h:424

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:1862

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

inline

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

Definition at line 1991 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:1862

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:178

void TNEANet::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the graph.

Definition at line 653 of file network.cpp.

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

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

inlineprotected

Definition at line 1840 of file network.h.

1840 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TNode > NodeH

Definition: network.h:1862

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

inlineprotected

Definition at line 1841 of file network.h.

1841 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:220

THash< TInt, TNode > NodeH

Definition: network.h:1862

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

Returns node attribute value, converted to Str type.

Definition at line 193 of file network.cpp.

                                                                                   {
   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();
 }

int TNEANet::GetNodes ( ) const

inline

Returns the number of nodes in the graph.

Definition at line 1969 of file network.h.

1969 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:1862

THash::Len

int Len() const

Definition: hash.h:186

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

inline

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

Definition at line 2221 of file network.h.

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

TNEANet::GetRndEId

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

Returns an ID of a random edge in the graph.

Definition: network.h:2219

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

inline

Returns an ID of a random edge in the graph.

Definition at line 2219 of file network.h.

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

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

THash::GetRndKeyId

int GetRndKeyId(TRnd &Rnd) const

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

Definition: hash.h:402

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:210

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

inline

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

Definition at line 2217 of file network.h.

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

TNEANet::GetNI

TNodeI GetNI(const int &NId) const

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

Definition: network.h:1991

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

inline

Returns an ID of a random node in the graph.

Definition at line 2215 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:1862

THash::GetRndKeyId

int GetRndKeyId(TRnd &Rnd) const

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

Definition: hash.h:402

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:210

int TNEANet::GetSAttrDatE	(	const TInt &	EId,
		const TStr &	AttrName,
		TInt &	ValX
	)		const

Gets Int sparse attribute with name AttrName from edge with id EId.

Definition at line 1573 of file network.cpp.

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

int TNEANet::GetSAttrDatE	(	const TInt &	EId,
		const TInt &	AttrId,
		TInt &	ValX
	)		const

Gets Int sparse attribute with id AttrId from edge with id EId.

Definition at line 1580 of file network.cpp.

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

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

inline

Gets Int sparse attribute with name AttrName from EdgeI.

Definition at line 2636 of file network.h.

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

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

inline

Gets Int sparse attribute with id AttrId from EdgeI.

Definition at line 2640 of file network.h.

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

int TNEANet::GetSAttrDatE	(	const TInt &	EId,
		const TStr &	AttrName,
		TFlt &	ValX
	)		const

Gets Flt sparse attribute with name AttrName from edge with id EId.

Definition at line 1587 of file network.cpp.

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

int TNEANet::GetSAttrDatE	(	const TInt &	EId,
		const TInt &	AttrId,
		TFlt &	ValX
	)		const

Gets Flt sparse attribute with id AttrId from edge with id EId.

Definition at line 1594 of file network.cpp.

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

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

inline

Gets Flt sparse attribute with name AttrName from EdgeI.

Definition at line 2650 of file network.h.

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

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

inline

Gets Flt sparse attribute with id AttrId from EdgeI.

Definition at line 2654 of file network.h.

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

int TNEANet::GetSAttrDatE	(	const TInt &	EId,
		const TStr &	AttrName,
		TStr &	ValX
	)		const

Gets Str sparse attribute with name AttrName from edge with id EId.

Definition at line 1601 of file network.cpp.

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

int TNEANet::GetSAttrDatE	(	const TInt &	EId,
		const TInt &	AttrId,
		TStr &	ValX
	)		const

Gets Str sparse attribute with id AttrId from edge with id EId.

Definition at line 1608 of file network.cpp.

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

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

inline

Gets Str sparse attribute with name AttrName from EdgeI.

Definition at line 2664 of file network.h.

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

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

inline

Gets Str sparse attribute with id AttrId from EdgeI.

Definition at line 2668 of file network.h.

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

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

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

Definition at line 1447 of file network.cpp.

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

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

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

Definition at line 1454 of file network.cpp.

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

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

inline

Gets Int sparse attribute with name AttrName from NodeI.

Definition at line 2518 of file network.h.

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

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

inline

Gets Int sparse attribute with id AttrId from NodeI.

Definition at line 2522 of file network.h.

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

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

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

Definition at line 1461 of file network.cpp.

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

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

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

Definition at line 1468 of file network.cpp.

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

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

inline

Gets Flt sparse attribute with name AttrName from NodeI.

Definition at line 2532 of file network.h.

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

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

inline

Gets Flt sparse attribute with id AttrId from NodeI.

Definition at line 2536 of file network.h.

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

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

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

Definition at line 1475 of file network.cpp.

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

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

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

Definition at line 1482 of file network.cpp.

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

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

inline

Gets Str sparse attribute with name AttrName from NodeI.

Definition at line 2546 of file network.h.

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

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

inline

Gets Str sparse attribute with id AttrId from NodeI.

Definition at line 2550 of file network.h.

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

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

Gets id and type for attribute with name Name.

Definition at line 1649 of file network.cpp.

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

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

Gets id and type for attribute with name Name.

Definition at line 1523 of file network.cpp.

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

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

Gets name and type for attribute with id AttrId.

Definition at line 1653 of file network.cpp.

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

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

Gets name and type for attribute with id AttrId.

Definition at line 1527 of file network.cpp.

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

int TNEANet::GetSAttrVE	(	const TInt &	EId,
		const TAttrType	AttrType,
		TAttrPrV &	AttrV
	)		const

Gets a list of all sparse attributes of type AttrType for edge with id EId.

Definition at line 1629 of file network.cpp.

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

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

inline

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

Definition at line 2688 of file network.h.

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

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

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

Definition at line 1503 of file network.cpp.

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

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

inline

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

Definition at line 2571 of file network.h.

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

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

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

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

inline

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

Definition at line 2341 of file network.h.

2341 { return GetStrAttrDatE(EdgeI.GetId(), attr); }

TNEANet::GetStrAttrDatE

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

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

Definition: network.h:2341

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

Definition at line 1082 of file network.cpp.

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

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

inline

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

Definition at line 2308 of file network.h.

2308 { return GetStrAttrDatN(NodeI.GetId(), attr); }

TNEANet::GetStrAttrDatN

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

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

Definition: network.h:2308

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

Definition at line 1046 of file network.cpp.

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

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

inlineprotected

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

Definition at line 1855 of file network.h.

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

TStr

Definition: dt.h:412

bool IsKey(const TKey &Key) const

Definition: hash.h:216

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

inlineprotected

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

Definition at line 1849 of file network.h.

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

TStr::GetNullStr

static TStr GetNullStr()

Definition: dt.cpp:1626

TStr

Definition: dt.h:412

TNEANet::GetStrAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:216

TStr TNEANet::GetStrAttrIndDatE	(	const TEdgeI &	EdgeI,
		const int &	index
	)

inline

Gets the value of a string edge attr specified by edge iterator EdgeI and the attr index.

Definition at line 2366 of file network.h.

2366 { return GetStrAttrIndDatE(EdgeI.GetId(), index); }

TStr GetStrAttrIndDatE(const TEdgeI &EdgeI, const int &index)

Gets the value of a string edge attr specified by edge iterator EdgeI and the attr index...

Definition: network.h:2366

TStr TNEANet::GetStrAttrIndDatE	(	const int &	EId,
		const int &	index
	)

Gets the value of an int edge attr specified by edge ID EId and the attr index.

Definition at line 1094 of file network.cpp.

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

TStr TNEANet::GetStrAttrIndDatN	(	const TNodeI &	NodeI,
		const int &	index
	)

inline

Gets the value of a string node attr specified by node iterator NodeI and the attr index.

Definition at line 2328 of file network.h.

2328 { return GetStrAttrIndDatN(NodeI.GetId(), index); }

TNEANet::GetStrAttrIndDatN

TStr GetStrAttrIndDatN(const TNodeI &NodeI, const int &index)

Gets the value of a string node attr specified by node iterator NodeI and the attr index...

Definition: network.h:2328

TStr TNEANet::GetStrAttrIndDatN	(	const int &	NId,
		const int &	index
	)

Gets the value of a string node attr specified by node ID NId and the attr index.

Definition at line 1058 of file network.cpp.

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

TFlt TNEANet::GetWeightOutEdges	(	const TNodeI &	NI,
		const TStr &	attr
	)

Gets the sum of the weights of all the outgoing edges of the node.

Definition at line 1371 of file network.cpp.

                                                                   {
   TNode Node = GetNode(NI.GetId());
   TIntV OutEIdV = Node.OutEIdV;
   TFlt total = 0;
   int len = Node.OutEIdV.Len();
   for (int i = 0; i < len; i++) {
     total += GetFltAttrDatE(Node.OutEIdV[i], attr);
   }
   return total;
 }

void TNEANet::GetWeightOutEdgesV	(	TFltV &	OutWeights,
		const TFltV &	AttrVal
	)

Fills OutWeights with the outgoing weight from each node.

Definition at line 1382 of file network.cpp.

                                                                         {
   for (TEdgeI it = BegEI(); it < EndEI(); it++) {
     int EId = it.GetId();
     int SrcId = it.GetSrcNId();
     OutWeights[SrcId] +=AttrVal[GetFltKeyIdE(EId)];
   }
 }

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.

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

2088 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::IntAttrNameEI

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

Returns a vector of int attr names for edge EId.

Definition: network.h:2088

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

Definition at line 227 of file network.cpp.

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

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2043 of file network.h.

2043 {

2044 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:2043

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

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

Definition at line 45 of file network.cpp.

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

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2092 of file network.h.

2092 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::IntAttrValueEI

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

Returns a vector of attr values for edge EId.

Definition: network.h:2092

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

Definition at line 237 of file network.cpp.

                                                                                          {
   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++;
   }  
 }

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

inline

Returns a vector of attr values for node NId.

Definition at line 2047 of file network.h.

2047 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

TNEANet::IntAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2047

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

Definition at line 55 of file network.cpp.

                                                                                          {
   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++;
   }  
 }

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

inline

Returns a vector of int attr names for edge EId.

Definition at line 2098 of file network.h.

2098 {

2099 IntVAttrNameEI(EId, KeyToIndexTypeE.BegI(), Names);}

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::IntVAttrNameEI

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

Returns a vector of int attr names for edge EId.

Definition: network.h:2098

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

Definition at line 248 of file network.cpp.

                                                                                         {
   Names = TVec<TStr>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == IntVType) {
       Names.Add(EdgeHI.GetKey());
     }
     EdgeHI++;
   }  
 }

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2053 of file network.h.

2053 {

2054 IntVAttrNameNI(NId, KeyToIndexTypeN.BegI(), Names);}

TNEANet::IntVAttrNameNI

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

Returns a vector of int attr names for node NId.

Definition: network.h:2053

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

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

Definition at line 66 of file network.cpp.

                                                                                         {
   Names = TVec<TStr>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == IntVType) {
       Names.Add(NodeHI.GetKey());
     }
     NodeHI++;
   }  
 }

void TNEANet::IntVAttrValueEI	(	const TInt &	EId,
		TVec< TIntV > &	Values
	)		const

inline

Returns a vector of attr values for edge EId.

Definition at line 2102 of file network.h.

2102 {

2103 IntVAttrValueEI(EId, KeyToIndexTypeE.BegI(), Values);}

TNEANet::IntVAttrValueEI

void IntVAttrValueEI(const TInt &EId, TVec< TIntV > &Values) const

Returns a vector of attr values for edge EId.

Definition: network.h:2102

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

void TNEANet::IntVAttrValueEI	(	const TInt &	EId,
		TStrIntPrH::TIter	EdgeHI,
		TVec< TIntV > &	Values
	)		const

Definition at line 258 of file network.cpp.

                                                                                                 {
   Values = TVec<TIntV>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == IntVType) {
       TIntV val = (this->VecOfIntVecVecsE.GetVal(EdgeHI.GetDat().Val2).GetVal(EId));
       Values.Add(val);
     }
     EdgeHI++;
   }  
 }

void TNEANet::IntVAttrValueNI	(	const TInt &	NId,
		TVec< TIntV > &	Values
	)		const

inline

Returns a vector of attr values for node NId.

Definition at line 2057 of file network.h.

2057 {

2058 IntVAttrValueNI(NId, KeyToIndexTypeN.BegI(), Values);}

TIter BegI() const

Definition: hash.h:171

TNEANet::IntVAttrValueNI

void IntVAttrValueNI(const TInt &NId, TVec< TIntV > &Values) const

Returns a vector of attr values for node NId.

Definition: network.h:2057

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

void TNEANet::IntVAttrValueNI	(	const TInt &	NId,
		TStrIntPrH::TIter	NodeHI,
		TVec< TIntV > &	Values
	)		const

Definition at line 76 of file network.cpp.

                                                                                                 {
   Values = TVec<TIntV>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == IntVType) {
       TIntV val = this->VecOfIntVecVecsN.GetVal(NodeHI.GetDat().Val2).GetVal(NodeH.GetKeyId(NId));
       Values.Add(val);
     }
     NodeHI++;
   }  
 }

bool TNEANet::IsAttrDeletedE	(	const int &	EId,
		const TStr &	attr
	)		const

Returns true if attr exists for edge EId and has default value.

Definition at line 311 of file network.cpp.

                                                                    {
   bool IntDel = IsIntAttrDeletedE(EId, attr);
   bool IntVDel = IsIntVAttrDeletedE(EId, attr);
   bool StrDel = IsStrAttrDeletedE(EId, attr);
   bool FltDel = IsFltAttrDeletedE(EId, attr);
   return IntDel || StrDel || FltDel || IntVDel;
 }

bool TNEANet::IsAttrDeletedN	(	const int &	NId,
		const TStr &	attr
	)		const

Returns true if attr exists for node NId and has default value.

Definition at line 129 of file network.cpp.

                                                                    {
   bool IntDel = IsIntAttrDeletedN(NId, attr);
   bool StrDel = IsStrAttrDeletedN(NId, attr);
   bool FltDel = IsFltAttrDeletedN(NId, attr);
   bool IntVDel = IsIntVAttrDeletedN(NId, attr);
   return IntDel || StrDel || FltDel || IntVDel;
 }

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

inline

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

Definition at line 2198 of file network.h.

2198 { return EdgeH.IsKey(EId); }

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

bool IsKey(const TKey &Key) const

Definition: hash.h:216

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

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

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

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

bool TNEANet::IsFltAttrDeletedE	(	const int &	EId,
		const TStr &	attr
	)		const

Returns true if Flt attr exists for edge NId and has default value.

Definition at line 331 of file network.cpp.

                                                                       {
   return EdgeAttrIsFltDeleted(EId, KeyToIndexTypeE.GetI(attr));
 }

bool TNEANet::IsFltAttrDeletedN	(	const int &	NId,
		const TStr &	attr
	)		const

Returns true if Flt attr exists for node NId and has default value.

Definition at line 149 of file network.cpp.

                                                                       {
   return NodeAttrIsFltDeleted(NId, KeyToIndexTypeN.GetI(attr));
 }

bool TNEANet::IsFltAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1390 of file network.cpp.

                                          {
   return (KeyToIndexTypeE.IsKey(attr) &&
     KeyToIndexTypeE.GetDat(attr).Val1 == FltType);
 }

bool TNEANet::IsIntAttrDeletedE	(	const int &	EId,
		const TStr &	attr
	)		const

Returns true if Int attr exists for edge EId and has default value.

Definition at line 319 of file network.cpp.

                                                                       {
   return EdgeAttrIsIntDeleted(EId, KeyToIndexTypeE.GetI(attr));
 }

bool TNEANet::IsIntAttrDeletedN	(	const int &	NId,
		const TStr &	attr
	)		const

Returns true if Int attr exists for node NId and has default value.

Definition at line 137 of file network.cpp.

                                                                       {
   return NodeAttrIsIntDeleted(NId, KeyToIndexTypeN.GetI(attr));
 }

bool TNEANet::IsIntAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1395 of file network.cpp.

                                          {
   return (KeyToIndexTypeE.IsKey(attr) &&
     KeyToIndexTypeE.GetDat(attr).Val1 == IntType);
 }

bool TNEANet::IsIntVAttrDeletedE	(	const int &	EId,
		const TStr &	attr
	)		const

Returns true if IntV attr exists for edge EId and is an empty vector.

Definition at line 323 of file network.cpp.

                                                                        {
   return EdgeAttrIsIntVDeleted(EId, KeyToIndexTypeE.GetI(attr));
 }

bool TNEANet::IsIntVAttrDeletedN	(	const int &	NId,
		const TStr &	attr
	)		const

Returns true if IntV attr exists for node NId and is an empty vector.

Definition at line 141 of file network.cpp.

                                                                        {
   return NodeAttrIsIntVDeleted(NId, KeyToIndexTypeN.GetI(attr));
 }

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

inline

Tests whether ID NId is a node.

Definition at line 1985 of file network.h.

1985 { return NodeH.IsKey(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:1862

bool IsKey(const TKey &Key) const

Definition: hash.h:216

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

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

bool TNEANet::IsStrAttrDeletedE	(	const int &	EId,
		const TStr &	attr
	)		const

Returns true if Str attr exists for edge NId and has default value.

Definition at line 327 of file network.cpp.

                                                                       {
   return EdgeAttrIsStrDeleted(EId, KeyToIndexTypeE.GetI(attr));
 }

bool TNEANet::IsStrAttrDeletedN	(	const int &	NId,
		const TStr &	attr
	)		const

Returns true if Str attr exists for node NId and has default value.

Definition at line 145 of file network.cpp.

                                                                       {
   return NodeAttrIsStrDeleted(NId, KeyToIndexTypeN.GetI(attr));
 }

bool TNEANet::IsStrAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1400 of file network.cpp.

                                          {
   return (KeyToIndexTypeE.IsKey(attr) &&
     KeyToIndexTypeE.GetDat(attr).Val1 == StrType);
 }

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

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:1880

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1570

static PNEANet TNEANet::Load_V1 ( TSIn & SIn )

inlinestatic

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

Definition at line 1948 of file network.h.

                                     {
     PNEANet Graph = PNEANet(new TNEANet());
     Graph->MxNId.Load(SIn); Graph->MxEId.Load(SIn);
     Graph->NodeH.Load(SIn); Graph->EdgeH.Load(SIn);
     Graph->KeyToIndexTypeN.Load(SIn); Graph->KeyToIndexTypeE.Load(SIn);
     Graph->IntDefaultsN.Load(SIn); Graph->IntDefaultsE.Load(SIn);
     Graph->StrDefaultsN.Load(SIn); Graph->StrDefaultsE.Load(SIn);
     Graph->FltDefaultsN.Load(SIn); Graph->FltDefaultsE.Load(SIn);
     Graph->VecOfIntVecsN.Load(SIn); Graph->VecOfIntVecsE.Load(SIn);
     Graph->VecOfStrVecsN.Load(SIn); Graph->VecOfStrVecsE.Load(SIn);
     Graph->VecOfFltVecsN.Load(SIn); Graph->VecOfFltVecsE.Load(SIn);
     return Graph;
   }

static PNEANet TNEANet::New ( )

inlinestatic

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

Definition at line 1940 of file network.h.

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:1880

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1570

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 Net = TNEANet::New(Nodes, Edges).

Definition at line 1944 of file network.h.

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:1880

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1570

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

Returns true if NId attr deleted for current node attr iterator.

Definition at line 153 of file network.cpp.

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

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

Returns true if NId attr deleted value for current node flt attr iterator.

Definition at line 185 of file network.cpp.

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

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

Returns true if NId attr deleted value for current node int attr iterator.

Definition at line 161 of file network.cpp.

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

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

Returns true if NId attr deleted value for current node int vector attr iterator.

Definition at line 169 of file network.cpp.

                                                                                        {
   if (NodeHI.GetDat().Val1 != IntVType) {
     return false;
   }
   return (TIntV() == this->VecOfIntVecVecsN.GetVal(
     this->KeyToIndexTypeN.GetDat(NodeHI.GetKey()).Val2).GetVal(NodeH.GetKeyId(NId)));
 }

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

Returns true if NId attr deleted value for current node str attr iterator.

Definition at line 177 of file network.cpp.

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

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

inline

Definition at line 1964 of file network.h.

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

2237 {

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

THash< TInt, TEdge > EdgeH

Definition: network.h:1863

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:180

THash< TInt, TNode > NodeH

Definition: network.h:1862

void TNEANet::Save ( TSOut & SOut ) const

inline

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

Definition at line 1918 of file network.h.

                                {
     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);
     VecOfIntVecVecsN.Save(SOut); VecOfIntVecVecsE.Save(SOut); 
     SAttrN.Save(SOut); SAttrE.Save(SOut); }

void TNEANet::Save_V1 ( TSOut & SOut ) const

inline

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

Definition at line 1930 of file network.h.

                                   {
     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); }

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

inline

Returns a vector of str attr names for node NId.

Definition at line 2108 of file network.h.

2108 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::StrAttrNameEI

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

Returns a vector of str attr names for node NId.

Definition: network.h:2108

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

Definition at line 269 of file network.cpp.

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

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

inline

Returns a vector of str attr names for node NId.

Definition at line 2063 of file network.h.

2063 {

2064 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:2063

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:1865

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

Definition at line 87 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2112 of file network.h.

2112 {

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

TIter BegI() const

Definition: hash.h:171

TStrIntPrH KeyToIndexTypeE

Definition: network.h:1865

TNEANet::StrAttrValueEI

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

Returns a vector of attr values for node NId.

Definition: network.h:2112

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

Definition at line 279 of file network.cpp.

                                                                                          {
   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++;
   }  
 }

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

inline

Returns a vector of attr values for node NId.

Definition at line 2067 of file network.h.

2067 {

2068 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:2067