SNAP Library 4.0, Developer Reference: TNEANet Class Reference

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

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

Definition at line 260 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr names for node NId.

Definition at line 2392 of file network.h.

2392 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

TNEANet::AttrNameNI

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

Returns a vector of attr names for node NId.

Definition: network.h:2392

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

Definition at line 68 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2442 of file network.h.

2442 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::AttrValueEI

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

Returns a vector of attr values for edge EId.

Definition: network.h:2442

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

Definition at line 270 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2396 of file network.h.

2396 {

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

TIter BegI() const

Definition: hash.h:213

TNEANet::AttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2396

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

Definition at line 78 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

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

Definition at line 2559 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 2483 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 2496 of file network.h.

References THash< TKey, TDat, THashFunc >::BegI(), and TVec< TVal, TSizeTy >::BegI().

                                              {
     TVec<TIntV>::TIter HI = NULL;
     THash<TInt, TIntV>::TIter HHI;
     TInt location = CheckDenseOrSparseE(attr);
     TBool IsDense = true;
     if (location != -1) {
       TInt index = KeyToIndexTypeE.GetDat(attr).Val2;
       if (location == 1) {
         HI = VecOfIntVecVecsE[index].BegI();
       } else {
         IsDense = false;
         HHI = VecOfIntHashVecsE[index].BegI();
       }
     }
     return TAIntVI(HI, HHI, attr, true, this, IsDense);
   }

Here is the call graph for this function:

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

inline

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

Definition at line 2548 of file network.h.

2548 {

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

TNEANet::VecOfStrVecsE

TVec< TStrV > VecOfStrVecsE

Definition: network.h:2039

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

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

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

Referenced by Dump(), GetWeightOutEdgesV(), and TUndirNet::IsOk().

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

TIter BegI() const

Definition: hash.h:213

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

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

Definition at line 2382 of file network.h.

2382 {

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:2040

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

2306 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:2038

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

TVec::BegI

TIter BegI() const

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

Definition: ds.h:593

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

References THash< TKey, TDat, THashFunc >::BegI(), and TVec< TVal, TSizeTy >::BegI().

                                              {
     TVec<TIntV>::TIter HI = NULL;
     THash<TInt, TIntV>::TIter HHI;
     TInt location = CheckDenseOrSparseN(attr);
     TBool IsDense = true;
     if (location != -1) {
       TInt index = KeyToIndexTypeN.GetDat(attr).Val2;
       if (location == 1) {
         HI = VecOfIntVecVecsN[index].BegI();
       } else {
         IsDense = false;
         HHI = VecOfIntHashVecsN[index].BegI();
       }
     }
     return TAIntVI(HI, HHI, attr, false, this, IsDense);
   }

Here is the call graph for this function:

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

inline

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

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

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

Referenced by Dump().

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

TIter BegI() const

Definition: hash.h:213

TNEANet::DelFromIntVAttrDatN

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

Here is the caller graph for this function:

TInt TNEANet::CheckDenseOrSparseE ( const TStr & attr ) const

inlineprotected

Definition at line 2089 of file network.h.

Referenced by AddIntVAttrDatE(), AppendIntVAttrDatE(), DelAttrDatE(), GetIntVAttrDatE(), and IntVAttrValueEI().

                                                    {
     if (!KeyToDenseE.IsKey(attr)) return -1;
     if (KeyToDenseE.GetDat(attr)) return 1;
     return 0;
   }

Here is the caller graph for this function:

TInt TNEANet::CheckDenseOrSparseN ( const TStr & attr ) const

inlineprotected

Return 1 if in Dense, 0 if in Sparse, -1 if neither.

Definition at line 2083 of file network.h.

Referenced by AddIntVAttrDatN(), AppendIntVAttrDatN(), TModeNet::ClrNbr(), DelAttrDatN(), DelAttrN(), DelFromIntVAttrDatN(), GetIntVAttrDatN(), IntVAttrValueNI(), and TModeNet::RemoveCrossNets().

                                                    {
     if (!KeyToDenseN.IsKey(attr)) return -1;
     if (KeyToDenseN.GetDat(attr)) return 1;
     return 0;
   }

Here is the caller graph for this function:

void TNEANet::Clr ( )

inline

Deletes all nodes and edges from the graph.

Definition at line 2627 of file network.h.

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

Referenced by TModeNet::Clr().

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

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::ConvertToSparse ( )

inline

Definition at line 2228 of file network.h.

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

                          {
     TInt VecLength = VecOfIntVecVecsN.Len();
     THash<TStr, TIntPr>::TIter iter;
     if (VecLength != 0) {
       VecOfIntHashVecsN = TVec<THash<TInt, TIntV> >(VecLength);
       for (iter = KeyToIndexTypeN.BegI(); !iter.IsEnd(); iter=iter.Next()) {
         if (iter.GetDat().Val1 == IntVType) {
           TStr attribute = iter.GetKey();
           TInt index = iter.GetDat().Val2();
           for (int i=0; i<VecOfIntVecVecsN[index].Len(); i++) {
             if(VecOfIntVecVecsN[index][i].Len() > 0) {
               VecOfIntHashVecsN[index].AddDat(TInt(i), VecOfIntVecVecsN[index][i]);
             }
           }
           KeyToDenseN.AddDat(attribute, TBool(false));
         }
       }
     }
     VecOfIntVecVecsN.Clr();
 
     VecLength = VecOfIntVecVecsE.Len();
     if (VecLength != 0) {
       VecOfIntHashVecsE = TVec<THash<TInt, TIntV> >(VecLength);
       for (iter = KeyToIndexTypeE.BegI(); !iter.IsEnd(); iter=iter.Next()) {
         if (iter.GetDat().Val1 == IntVType) {
           TStr attribute = iter.GetKey();
           TInt index = iter.GetDat().Val2();
           for (int i=0; i<VecOfIntVecVecsE[index].Len(); i++) {
             if(VecOfIntVecVecsE[index][i].Len() > 0) {
               VecOfIntHashVecsE[index].AddDat(TInt(i), VecOfIntVecVecsE[index][i]);
             }
           }
           KeyToDenseE.AddDat(attribute, TBool(false));
         }
       }
     }
     VecOfIntVecVecsE.Clr();
   }

Here is the call graph for this function:

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

Defragments the graph.

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

Definition at line 765 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Deletes the edge attribute for NodeI.

Definition at line 2771 of file network.h.

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

Referenced by DelAttrDatE().

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

TNEANet::DelAttrDatE

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

Deletes the edge attribute for NodeI.

Definition: network.h:2771

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1247 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Deletes the node attribute for NodeI.

Definition at line 2768 of file network.h.

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

Referenced by DelAttrDatN().

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

TNEANet::DelAttrDatN

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

Deletes the node attribute for NodeI.

Definition: network.h:2768

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1229 of file network.cpp.

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

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

Here is the call graph for this function:

int TNEANet::DelAttrE ( const TStr & attr )

Removes all the values for edge attr.

Definition at line 1447 of file network.cpp.

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

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

Here is the call graph for this function:

int TNEANet::DelAttrN ( const TStr & attr )

Removes all the values for node attr.

Definition at line 1418 of file network.cpp.

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

Referenced by TModeNet::DelNbrType().

                                       {
   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) {
     TInt location = CheckDenseOrSparseN(attr);
     if (location == 1) VecOfIntVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TIntV>();
     else VecOfIntHashVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = THash<TInt, TIntV>();
     KeyToDenseN.DelKey(attr);
   } else {
     return -1;
   }
   KeyToIndexTypeN.DelKey(attr);
   return 0;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::DelEdge ( const int & EId )

Deletes an edge with edge ID EId from the graph.

Definition at line 692 of file network.cpp.

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

Referenced by DelEdge().

                                     {
   int i;
 
   IAssert(IsEdge(EId));
   const int SrcNId = GetEdge(EId).GetSrcNId();
   const int DstNId = GetEdge(EId).GetDstNId();
   GetNode(SrcNId).OutEIdV.DelIfIn(EId);
   GetNode(DstNId).InEIdV.DelIfIn(EId);
   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);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

If the edge (SrcNId, DstNId) does not exist in the graph function still completes. But the function aborts if SrcNId or DstNId are not nodes in the graph.

Definition at line 720 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Referenced by DelFromIntVAttrDatN(), and TModeNet::DelNeighbor().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 962 of file network.cpp.

References CheckDenseOrSparseN(), TVec< TVal, TSizeTy >::DelIfIn(), THash< TKey, TDat, THashFunc >::GetDat(), THash< TKey, TDat, THashFunc >::GetKeyId(), IsNode(), KeyToIndexTypeN, NodeH, TPair< TVal1, TVal2 >::Val2, VecOfIntHashVecsN, and VecOfIntVecVecsN.

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

Here is the call graph for this function:

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

References THash< TKey, TDat, THashFunc >::DelKey(), TAttr::DelSAttrId(), EdgeH, TNEANet::TEdge::GetDstNId(), GetEdge(), TNEANet::TNode::GetInDeg(), TNEANet::TNode::GetInEId(), THash< TKey, TDat, THashFunc >::GetKeyId(), GetNode(), TStr::GetNullStr(), TNEANet::TNode::GetOutDeg(), TNEANet::TNode::GetOutEId(), TNEANet::TEdge::GetSrcNId(), IAssert, THash< TKey, TDat, THashFunc >::IsKey(), TVec< TVal, TSizeTy >::Len(), TInt::Mn, TFlt::Mn, NodeH, SAttrN, VecOfFltVecsE, VecOfFltVecsN, VecOfIntHashVecsE, VecOfIntHashVecsN, VecOfIntVecsE, VecOfIntVecsN, VecOfIntVecVecsE, VecOfIntVecVecsN, VecOfStrVecsE, and VecOfStrVecsN.

Referenced by TModeNet::DelNode().

                                     {
   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 (i = 0; i < VecOfIntHashVecsE.Len(); i++) {
       THash<TInt, TIntV>& IntHashV = VecOfIntHashVecsE[i];
       if (IntHashV.IsKey(EdgeH.GetKeyId(EId))) {
         IntHashV.DelKey(EdgeH.GetKeyId(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();
     }
     for (i = 0; i < VecOfIntHashVecsE.Len(); i++) {
       THash<TInt, TIntV>& IntHashV = VecOfIntHashVecsE[i];
       if (IntHashV.IsKey(EdgeH.GetKeyId(EId))) {
         IntHashV.DelKey(EdgeH.GetKeyId(EId));
       }
     }
     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();
   }
   for (i = 0; i < VecOfIntHashVecsN.Len(); i++) {
     THash<TInt, TIntV>& IntHashV = VecOfIntHashVecsN[i];
     if (IntHashV.IsKey(NodeH.GetKeyId(NId))) {
       IntHashV.DelKey(NodeH.GetKeyId(NId));
     }
   }
   NodeH.DelKey(NId);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::DelNode ( const TNode & NodeI )

inline

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

Definition at line 2296 of file network.h.

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

Referenced by DelNode().

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

TNEANet::DelNode

virtual void DelNode(const int &NId)

Deletes node of ID NId from the graph.

Definition: network.cpp:531

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 1753 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Definition at line 1760 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Deletes sparse attribute with name AttrName from EdgeI.

Definition at line 3075 of file network.h.

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

inline

Deletes sparse attribute with id AttrId from EdgeI.

Definition at line 3079 of file network.h.

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

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

Definition at line 1627 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Definition at line 1634 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Deletes sparse attribute with name AttrName from NodeI.

Definition at line 2957 of file network.h.

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

inline

Deletes sparse attribute with id AttrId from NodeI.

Definition at line 2961 of file network.h.

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

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

Definition at line 827 of file network.cpp.

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

                                    {
   const int NodePlaces = (int) ceil(log10((double) GetNodes()));
   const int EdgePlaces = (int) ceil(log10((double) GetEdges()));
   fprintf(OutF, "-------------------------------------------------\nDirected Node-Edge Network 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");
 }

Here is the call graph for this function:

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

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

Referenced by AttrNameEI(), and AttrValueEI().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 424 of file network.cpp.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 406 of file network.cpp.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::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 412 of file network.cpp.

References EdgeH, THashKeyDatI< TKey, TDat >::GetDat(), THash< TKey, TDat, THashFunc >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntVType, KeyToIndexTypeE, and VecOfIntVecVecsE.

Referenced by EdgeAttrIsDeleted(), and IsIntVAttrDeletedE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 418 of file network.cpp.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::Empty ( ) const

inline

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

Definition at line 2625 of file network.h.

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

2625 { return GetNodes()==0; }

TNEANet::GetNodes

int GetNodes() const

Returns the number of nodes in the network.

Definition: network.h:2276

Here is the call graph for this function:

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

inline

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

Definition at line 2563 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 2487 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 2513 of file network.h.

References THash< TKey, TDat, THashFunc >::EndI(), and TVec< TVal, TSizeTy >::EndI().

                                              {
     TVec<TIntV>::TIter HI = NULL;
     THash<TInt, TIntV>::TIter HHI;
     TInt location = CheckDenseOrSparseE(attr);
     TBool IsDense = true;
     if (location != -1) {
       TInt index = KeyToIndexTypeE.GetDat(attr).Val2;
       if (location == 1) {
         HI = VecOfIntVecVecsE[index].EndI();
       } else {
         IsDense = false;
         HHI = VecOfIntHashVecsE[index].EndI();
       }
     }
     return TAIntVI(HI, HHI, attr, true, this, IsDense);
   }

Here is the call graph for this function:

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

inline

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

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

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

Referenced by Dump(), GetWeightOutEdgesV(), and TUndirNet::IsOk().

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

THash::EndI

TIter EndI() const

Definition: hash.h:218

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

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

Definition at line 2385 of file network.h.

2385 {

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:2040

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

2309 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:2038

TVec::EndI

TIter EndI() const

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

Definition: ds.h:595

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

References THash< TKey, TDat, THashFunc >::EndI(), and TVec< TVal, TSizeTy >::EndI().

                                              {
     TVec<TIntV>::TIter HI = NULL;
     THash<TInt, TIntV>::TIter HHI;
     TInt location = CheckDenseOrSparseN(attr);
     TBool IsDense = true;
     if (location != -1) {
       TInt index = KeyToIndexTypeN.GetDat(attr).Val2;
       if (location == 1) {
         HI = VecOfIntVecVecsN[index].EndI();
       } else {
         IsDense = false;
         HHI = VecOfIntHashVecsN[index].EndI();
       }
     }
     return TAIntVI(HI, HHI, attr, false, this, IsDense);
   }

Here is the call graph for this function:

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

inline

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

Definition at line 2376 of file network.h.

2376 {

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNEANet::VecOfStrVecsN

TVec< TStrV > VecOfStrVecsN

Definition: network.h:2039

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

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

Referenced by Dump(), TUndirNet::GetEI(), and TDirNet::GetEI().

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

THash::EndI

TIter EndI() const

Definition: hash.h:218

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2474 of file network.h.

2474 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::FltAttrNameEI

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

Returns a vector of int attr names for node NId.

Definition: network.h:2474

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

Definition at line 353 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2429 of file network.h.

2429 {

2430 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:2429

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

Definition at line 161 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2478 of file network.h.

Referenced by Dump().

2478 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::FltAttrValueEI

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

Returns a vector of attr values for node NId.

Definition: network.h:2478

Here is the caller graph for this function:

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

Definition at line 363 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2433 of file network.h.

Referenced by Dump().

2433 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

TNEANet::FltAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2433

Here is the caller graph for this function:

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

Definition at line 171 of file network.cpp.

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

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

Here is the call graph for this function:

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

References TVec< TVal, TSizeTy >::Add(), THash< TKey, TDat, THashFunc >::BegI(), THash< TKey, TDat, THashFunc >::EndI(), FltType, IntType, KeyToIndexTypeE, and StrType.

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

Here is the call graph for this function:

int TNEANet::GetAttrIndE ( const TStr & attr )

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

Definition at line 1225 of file network.cpp.

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

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

Here is the call graph for this function:

int TNEANet::GetAttrIndN ( const TStr & attr )

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

Definition at line 1187 of file network.cpp.

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

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

Here is the call graph for this function:

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

References TVec< TVal, TSizeTy >::Add(), THash< TKey, TDat, THashFunc >::BegI(), THash< TKey, TDat, THashFunc >::EndI(), FltType, IntType, KeyToIndexTypeN, and StrType.

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

Here is the call graph for this function:

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

inline

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

Definition at line 2567 of file network.h.

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

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

Here is the call graph for this function:

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

inline

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

Definition at line 2491 of file network.h.

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

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

Here is the call graph for this function:

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

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

                                                              {
     TVec<TIntV>::TIter HI = NULL;
     THash<TInt, TIntV>::TIter HHI;
     TInt location = CheckDenseOrSparseE(attr);
     TBool IsDense = true;
     if (location != -1) {
       TInt index = KeyToIndexTypeE.GetDat(attr).Val2;
       if (location == 1) {
         HI = VecOfIntVecVecsE[index].GetI(EdgeH.GetKeyId(EId));
       } else {
         IsDense = false;
         HHI = VecOfIntHashVecsE[index].GetI(EdgeH.GetKeyId(EId));
       }
     }
     return TAIntVI(HI, HHI, attr, true, this, IsDense);
   }

Here is the call graph for this function:

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

inline

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

Definition at line 2555 of file network.h.

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

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

Here is the call graph for this function:

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

inlineprotected

Definition at line 2007 of file network.h.

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

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

2007 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

Here is the call graph for this function:

Here is the caller graph for this function:

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

inlineprotected

Definition at line 2008 of file network.h.

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

2008 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

Here is the call graph for this function:

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

Returns edge attribute value, converted to Str type.

Definition at line 430 of file network.cpp.

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

Referenced by AttrValueEI().

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

Here is the call graph for this function:

Here is the caller graph for this function:

int TNEANet::GetEdges ( ) const

inline

Returns the number of edges in the graph.

Definition at line 2576 of file network.h.

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

Referenced by Dump(), TUndirNet::Dump(), TDirNet::Dump(), GetEIdV(), and TUndirNet::IsOk().

2576 { return EdgeH.Len(); }

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

THash::Len

int Len() const

Definition: hash.h:228

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

Returns an iterator referring to edge with edge ID EId.

Definition at line 2607 of file network.h.

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

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

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

Here is the call graph for this function:

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

inline

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

Definition at line 2609 of file network.h.

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

Referenced by GetEI().

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

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

Definition at line 2601 of file network.h.

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

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

Here is the call graph for this function:

void TNEANet::GetEIdV ( TIntV & EIdV ) const

Gets a vector IDs of all edges in the graph.

Definition at line 758 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

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

Definition at line 2741 of file network.h.

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

Referenced by GetFltAttrDatE(), and GetWeightOutEdges().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1205 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

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

Definition at line 2708 of file network.h.

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

Referenced by TMMNet::AddNodeAttributes(), GetFltAttrDatN(), and TMMNet::ToNetwork().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1167 of file network.cpp.

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

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

Here is the call graph for this function:

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

inlineprotected

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

Definition at line 2023 of file network.h.

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

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

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

TNEANet::FltDefaultsE

THash< TStr, TFlt > FltDefaultsE

Definition: network.h:2037

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TFlt

Definition: dt.h:1383

bool IsKey(const TKey &Key) const

Definition: hash.h:258

TFlt::Mn

static const double Mn

Definition: dt.h:1387

Here is the call graph for this function:

Here is the caller graph for this function:

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

inlineprotected

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

Definition at line 2017 of file network.h.

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

Referenced by AddAttributes(), AddFltAttrDatN(), DelAttrDatN(), NodeAttrIsFltDeleted(), and TMMNet::ToNetwork().

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

TNEANet::FltDefaultsN

THash< TStr, TFlt > FltDefaultsN

Definition: network.h:2037

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TFlt

Definition: dt.h:1383

TNEANet::GetFltAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:258

TFlt::Mn

static const double Mn

Definition: dt.h:1387

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by GetFltAttrIndDatE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

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

Here is the call graph for this function:

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

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

Referenced by GetFltAttrIndDatN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

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

Here is the call graph for this function:

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

Gets Vector for the Flt Attribute attr.

Definition at line 1145 of file network.cpp.

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

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

Here is the call graph for this function:

int TNEANet::GetFltKeyIdE ( const int & EId )

Gets keyid for edge with id EId.

Definition at line 1149 of file network.cpp.

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

Referenced by GetWeightOutEdgesV().

                                         {
   return EdgeH.GetKeyId(EId);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

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

References TAttr::GetIdVSAttr(), and SAttrE.

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

Here is the call graph for this function:

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

References TAttr::GetIdVSAttr(), and SAttrE.

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

Here is the call graph for this function:

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

References TAttr::GetIdVSAttr(), and SAttrN.

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

Here is the call graph for this function:

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

References TAttr::GetIdVSAttr(), and SAttrN.

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

Here is the call graph for this function:

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

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

Referenced by GetIntAttrDatE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1191 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

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

Definition at line 2701 of file network.h.

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

Referenced by TMMNet::AddNodeAttributes(), GetIntAttrDatN(), and TMMNet::ToNetwork().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1153 of file network.cpp.

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

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

Here is the call graph for this function:

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

inlineprotected

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

Definition at line 2019 of file network.h.

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

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

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

TNEANet::IntDefaultsE

THash< TStr, TInt > IntDefaultsE

Definition: network.h:2035

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TInt::Mn

static const int Mn

Definition: dt.h:1138

TInt

Definition: dt.h:1134

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the call graph for this function:

Here is the caller graph for this function:

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

inlineprotected

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

Definition at line 2013 of file network.h.

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

Referenced by AddAttributes(), AddIntAttrDatN(), DelAttrDatN(), NodeAttrIsIntDeleted(), and TMMNet::ToNetwork().

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TInt::Mn

static const int Mn

Definition: dt.h:1138

TInt

Definition: dt.h:1134

TNEANet::IntDefaultsN

THash< TStr, TInt > IntDefaultsN

Definition: network.h:2035

TNEANet::GetIntAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by GetIntAttrIndDatE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 1209 of file network.cpp.

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

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

Here is the call graph for this function:

TInt TNEANet::GetIntAttrIndDatN	(	const TNodeI &	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 2720 of file network.h.

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

Referenced by GetIntAttrIndDatN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 1171 of file network.cpp.

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

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

Here is the call graph for this function:

int TNEANet::GetIntAttrIndE ( const TStr & attr )

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

Definition at line 1221 of file network.cpp.

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

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

Here is the call graph for this function:

int TNEANet::GetIntAttrIndN ( const TStr & attr )

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

Definition at line 1183 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Referenced by GetIntVAttrDatE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1195 of file network.cpp.

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

                                                                {
   TInt location = CheckDenseOrSparseE(attr);
   if (location != 0) return VecOfIntVecVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)];
   else return VecOfIntHashVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)];
 }

Here is the call graph for this function:

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

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

Referenced by TMMNet::AddNodeAttributes(), GetIntVAttrDatN(), TModeNet::GetNeighborsByCrossNet(), and TMMNet::ToNetwork().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1157 of file network.cpp.

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

                                                                      {
   TInt location = CheckDenseOrSparseN(attr);
   if (location != 0) return VecOfIntVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)];
   else return VecOfIntHashVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)];
 }

Here is the call graph for this function:

int TNEANet::GetMxEId ( ) const

inline

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

Definition at line 2573 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxEId.

2573 { return MxEId; }

TNEANet::MxEId

TInt MxEId

Definition: network.h:2027

int TNEANet::GetMxNId ( ) const

inline

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

Definition at line 2571 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::MxNId.

2571 { return MxNId; }

TNEANet::MxNId

TInt MxNId

Definition: network.h:2027

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

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

2388 {

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:466

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:2040

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

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

inline

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

Definition at line 2312 of file network.h.

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

2312 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:2038

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:466

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:2028

TVec::GetI

TIter GetI(const TSizeTy &ValN) const

Returns an iterator an element at position ValN.

Definition: ds.h:597

Here is the call graph for this function:

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

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

                                                              {
     TVec<TIntV>::TIter HI = NULL;
     THash<TInt, TIntV>::TIter HHI;
     TInt location = CheckDenseOrSparseN(attr);
     TBool IsDense = true;
     if (location != -1) {
       TInt index = KeyToIndexTypeN.GetDat(attr).Val2;
       if (location == 1) {
         HI = VecOfIntVecVecsN[index].GetI(NodeH.GetKeyId(NId));
       } else {
         IsDense = false;
         HHI = VecOfIntHashVecsN[index].GetI(NodeH.GetKeyId(NId));
       }
     }
     return TAIntVI(HI, HHI, attr, false, this, IsDense);
   }

Here is the call graph for this function:

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

inline

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

Definition at line 2379 of file network.h.

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

2379 {

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNEANet::VecOfStrVecsN

TVec< TStrV > VecOfStrVecsN

Definition: network.h:2039

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:466

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

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

inline

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

Definition at line 2304 of file network.h.

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

Referenced by TUndirNet::GetEI(), and TDirNet::GetEI().

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

THash< TInt, TNode > NodeH

Definition: network.h:2028

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the graph.

Definition at line 751 of file network.cpp.

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

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

Here is the call graph for this function:

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

inlineprotected

Definition at line 2005 of file network.h.

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

Referenced by AddEdge(), TUndirNet::AddEdge(), TDirNet::AddEdge(), TUndirNet::AddEdgeUnchecked(), TDirNet::AddEdgeUnchecked(), TUndirNet::AddNode(), DelEdge(), TUndirNet::DelEdge(), TDirNet::DelEdge(), DelNode(), TUndirNet::DelNode(), TDirNet::DelNode(), GetWeightOutEdges(), IsEdge(), TUndirNet::IsEdge(), and TDirNet::IsEdge().

2005 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

Here is the caller graph for this function:

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

inlineprotected

Definition at line 2006 of file network.h.

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

2006 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

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

Returns node attribute value, converted to Str type.

Definition at line 246 of file network.cpp.

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

Referenced by AttrValueNI().

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

Here is the call graph for this function:

Here is the caller graph for this function:

int TNEANet::GetNodes ( ) const

inline

Returns the number of nodes in the network.

Definition at line 2276 of file network.h.

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

Referenced by Dump(), TUndirNet::Dump(), TDirNet::Dump(), GetNIdV(), TUndirNet::GetNIdV(), TDirNet::GetNIdV(), and TMMNet::ToNetworkMP().

2276 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:2028

THash::Len

int Len() const

Definition: hash.h:228

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

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

Definition at line 2618 of file network.h.

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

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

TNEANet::GetRndEId

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

Returns an ID of a random edge in the graph.

Definition: network.h:2616

Here is the call graph for this function:

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

inline

Returns an ID of a random edge in the graph.

Definition at line 2616 of file network.h.

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

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

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

THash::GetRndKeyId

int GetRndKeyId(TRnd &Rnd) const

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

Definition: hash.h:444

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:252

Here is the call graph for this function:

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

inline

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

Definition at line 2614 of file network.h.

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

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

TNEANet::GetNI

TNodeI GetNI(const int &NId) const

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

Definition: network.h:2304

Here is the call graph for this function:

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

inline

Returns an ID of a random node in the graph.

Definition at line 2612 of file network.h.

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

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

THash< TInt, TNode > NodeH

Definition: network.h:2028

THash::GetRndKeyId

int GetRndKeyId(TRnd &Rnd) const

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

Definition: hash.h:444

THash::GetKey

const TKey & GetKey(const int &KeyId) const

Definition: hash.h:252

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

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

Gets id and type for attribute with name Name.

Definition at line 1787 of file network.cpp.

References TAttr::GetSAttrId(), and SAttrE.

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

Here is the call graph for this function:

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

Gets id and type for attribute with name Name.

Definition at line 1661 of file network.cpp.

References TAttr::GetSAttrId(), and SAttrN.

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

Here is the call graph for this function:

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

Gets name and type for attribute with id AttrId.

Definition at line 1791 of file network.cpp.

References TAttr::GetSAttrName(), and SAttrE.

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

Here is the call graph for this function:

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

Gets name and type for attribute with id AttrId.

Definition at line 1665 of file network.cpp.

References TAttr::GetSAttrName(), and SAttrN.

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TEdgeI::GetId().

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

Here is the call graph for this function:

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

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

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

Here is the call graph for this function:

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

References TNEANet::TNodeI::GetId().

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

Here is the call graph for this function:

PNEANet TNEANet::GetSmallGraph ( )

static

Returns a small multigraph on 5 nodes and 6 edges.

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

Definition at line 1472 of file network.cpp.

References New().

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

Here is the call graph for this function:

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

inline

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

Definition at line 2738 of file network.h.

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

Referenced by GetStrAttrDatE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1201 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

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

Definition at line 2705 of file network.h.

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

Referenced by TMMNet::AddNodeAttributes(), GetStrAttrDatN(), and TMMNet::ToNetwork().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

Definition at line 1163 of file network.cpp.

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

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

Here is the call graph for this function:

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

inlineprotected

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

Definition at line 2021 of file network.h.

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

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

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStr::GetNullStr

static TStr GetNullStr()

Definition: dt.cpp:1626

TNEANet::StrDefaultsE

THash< TStr, TStr > StrDefaultsE

Definition: network.h:2036

TStr

Definition: dt.h:412

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the call graph for this function:

Here is the caller graph for this function:

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

inlineprotected

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

Definition at line 2015 of file network.h.

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

Referenced by AddAttributes(), AddStrAttrDatN(), DelAttrDatN(), NodeAttrIsStrDeleted(), and TMMNet::ToNetwork().

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

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TNEANet::StrDefaultsN

THash< TStr, TStr > StrDefaultsN

Definition: network.h:2036

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by GetStrAttrIndDatE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

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

Here is the call graph for this function:

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

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

Referenced by GetStrAttrIndDatN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

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

Here is the call graph for this function:

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

References GetFltAttrDatE(), TNEANet::TNodeI::GetId(), GetNode(), TVec< TVal, TSizeTy >::Len(), and TNEANet::TNode::OutEIdV.

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

Here is the call graph for this function:

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

Fills OutWeights with the outgoing weight from each node.

Definition at line 1520 of file network.cpp.

References BegEI(), EndEI(), and GetFltKeyIdE().

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

Here is the call graph for this function:

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

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

Definition at line 46 of file network.cpp.

References HasGraphFlag.

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

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

inline

Returns a vector of int attr names for edge EId.

Definition at line 2446 of file network.h.

2446 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::IntAttrNameEI

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

Returns a vector of int attr names for edge EId.

Definition: network.h:2446

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

Definition at line 280 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2401 of file network.h.

2401 {

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

TIter BegI() const

Definition: hash.h:213

TNEANet::IntAttrNameNI

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

Returns a vector of int attr names for node NId.

Definition: network.h:2401

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

Definition at line 88 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2450 of file network.h.

Referenced by Dump().

2450 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::IntAttrValueEI

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

Returns a vector of attr values for edge EId.

Definition: network.h:2450

Here is the caller graph for this function:

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

Definition at line 290 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2405 of file network.h.

Referenced by Dump().

2405 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

TNEANet::IntAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2405

Here is the caller graph for this function:

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

Definition at line 98 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of int attr names for edge EId.

Definition at line 2456 of file network.h.

2456 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::IntVAttrNameEI

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

Returns a vector of int attr names for edge EId.

Definition: network.h:2456

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

Definition at line 301 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2411 of file network.h.

2411 {

2412 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:2411

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

Definition at line 109 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2460 of file network.h.

2460 {

2461 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:2460

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

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

Definition at line 311 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), CheckDenseOrSparseE(), EdgeH, THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntVType, THashKeyDatI< TKey, TDat >::IsEnd(), THash< TKey, TDat, THashFunc >::IsKey(), TVec< TVal, TSizeTy >::Len(), VecOfIntHashVecsE, and VecOfIntVecVecsE.

                                                                                                 {
   Values = TVec<TIntV>();
   while (!EdgeHI.IsEnd()) {
     if (EdgeHI.GetDat().Val1 == IntVType) {
       TInt index = EdgeHI.GetDat().Val2;
       TStr attr =  EdgeHI.GetKey();
       TInt loc = CheckDenseOrSparseE(attr);
       if (loc == 1) {
         TIntV val = this->VecOfIntVecVecsE.GetVal(index).GetVal(EdgeH.GetKeyId(EId));
         if (val.Len() != 0) Values.Add(val);
       } else {
         const THash<TInt, TIntV>& NewHash = VecOfIntHashVecsE[index];
         if (NewHash.IsKey(EdgeH.GetKeyId(EId))) {
           Values.Add(NewHash[EdgeH.GetKeyId(EId)]);
         }
       }
     }
     EdgeHI++;
   }
 }

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2415 of file network.h.

2415 {

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

TIter BegI() const

Definition: hash.h:213

TNEANet::IntVAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2415

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

Definition at line 119 of file network.cpp.

References TVec< TVal, TSizeTy >::Add(), CheckDenseOrSparseN(), THashKeyDatI< TKey, TDat >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntVType, THashKeyDatI< TKey, TDat >::IsEnd(), THash< TKey, TDat, THashFunc >::IsKey(), TVec< TVal, TSizeTy >::Len(), NodeH, VecOfIntHashVecsN, and VecOfIntVecVecsN.

                                                                                                 {
   Values = TVec<TIntV>();
   while (!NodeHI.IsEnd()) {
     if (NodeHI.GetDat().Val1 == IntVType) {
       TInt index = NodeHI.GetDat().Val2;
       TStr attr =  NodeHI.GetKey();
       TInt loc = CheckDenseOrSparseN(attr);
       if (loc == 1) {
         TIntV val = this->VecOfIntVecVecsN.GetVal(index).GetVal(NodeH.GetKeyId(NId));
         if (val.Len() != 0) Values.Add(val);
       } else {
         const THash<TInt, TIntV>& NewHash = VecOfIntHashVecsN[index];
         if (NewHash.IsKey(NodeH.GetKeyId(NId))) {
           Values.Add(NewHash[NodeH.GetKeyId(NId)]);
         }
       }
     }
     NodeHI++;
   }
 }

Here is the call graph for this function:

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

References IsFltAttrDeletedE(), IsIntAttrDeletedE(), IsIntVAttrDeletedE(), and IsStrAttrDeletedE().

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

Here is the call graph for this function:

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

References IsFltAttrDeletedN(), IsIntAttrDeletedN(), IsIntVAttrDeletedN(), and IsStrAttrDeletedN().

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

Here is the call graph for this function:

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

inline

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

Definition at line 2595 of file network.h.

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

Referenced by AddEdge(), TUndirNet::AddEdge(), TDirNet::AddEdge(), AddFltAttrDatE(), AddIntAttrDatE(), AddSAttrDatE(), TUndirNet::AddSAttrDatE(), TDirNet::AddSAttrDatE(), AddStrAttrDatE(), DelEdge(), DelSAttrDatE(), TUndirNet::DelSAttrDatE(), TDirNet::DelSAttrDatE(), GetSAttrDatE(), TUndirNet::GetSAttrDatE(), TDirNet::GetSAttrDatE(), GetSAttrVE(), TUndirNet::GetSAttrVE(), TDirNet::GetSAttrVE(), and IsOk().

2595 { return EdgeH.IsKey(EId); }

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

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

Definition at line 2597 of file network.h.

References IsEdge().

Referenced by IsEdge().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 730 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Definition at line 394 of file network.cpp.

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

Referenced by IsAttrDeletedE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by IsAttrDeletedN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::IsFltAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1528 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Referenced by IsAttrDeletedE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by IsAttrDeletedN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::IsIntAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1533 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Referenced by IsAttrDeletedE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by IsAttrDeletedN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

Tests whether ID NId is a node.

Definition at line 2298 of file network.h.

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

Referenced by TCrossNet::AddEdge(), AddEdge(), TUndirNet::AddEdge(), TDirNet::AddEdge(), AddFltAttrDatN(), AddIntAttrDatN(), AddIntVAttrDatE(), AddIntVAttrDatN(), AddNode(), TUndirNet::AddNode(), TDirNet::AddNode(), AddNodeUnchecked(), TUndirNet::AddNodeUnchecked(), TDirNet::AddNodeUnchecked(), AddSAttrDatN(), TUndirNet::AddSAttrDatN(), TDirNet::AddSAttrDatN(), AddStrAttrDatN(), AppendIntVAttrDatE(), AppendIntVAttrDatN(), TUndirNet::DelEdge(), TDirNet::DelEdge(), DelFromIntVAttrDatN(), TUndirNet::DelNode(), DelSAttrDatN(), TUndirNet::DelSAttrDatN(), TDirNet::DelSAttrDatN(), GetSAttrDatN(), TUndirNet::GetSAttrDatN(), TDirNet::GetSAttrDatN(), GetSAttrVN(), TUndirNet::GetSAttrVN(), TDirNet::GetSAttrVN(), TUndirNet::IsEdge(), TDirNet::IsEdge(), IsOk(), TUndirNet::IsOk(), TDirNet::IsOk(), TSnap::LoadMode(), and TMMNet::ToNetworkMP().

2298 { return NodeH.IsKey(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:2028

bool IsKey(const TKey &Key) const

Definition: hash.h:258

Here is the call graph for this function:

Here is the caller graph for this function:

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

Checks the graph data structure for internal consistency.

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

Definition at line 774 of file network.cpp.

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

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

Here is the call graph for this function:

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

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

Referenced by IsAttrDeletedE().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Referenced by IsAttrDeletedN().

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

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::IsStrAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1538 of file network.cpp.

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

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

Here is the call graph for this function:

static PNEANet TNEANet::Load ( TSIn & SIn )

inlinestatic

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

Definition at line 2182 of file network.h.

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:2097

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1720

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 2184 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::Load_V2 ( TSIn & SIn )

inlinestatic

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

Definition at line 2199 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);
     Graph->VecOfIntVecVecsN.Load(SIn); Graph->VecOfIntVecVecsE.Load(SIn);
     Graph->SAttrN.Load(SIn); Graph->SAttrE.Load(SIn);
     return Graph;
   }

void TNEANet::LoadNetworkShM ( TShMIn & ShMIn )

load network from shared memory for this network

Definition at line 2 of file network.cpp.

Referenced by TModeNet::LoadShM(), and LoadShM().

                                           {
   MxNId = TInt(ShMIn);
   MxEId = TInt(ShMIn);
 
   LoadTNodeFunctor NodeFn;
   NodeH.LoadShM(ShMIn, NodeFn);
 
   EdgeH.LoadShM(ShMIn);
   KeyToIndexTypeN.LoadShM(ShMIn);
   KeyToIndexTypeE.LoadShM(ShMIn);
       
   KeyToDenseN.LoadShM(ShMIn);
   KeyToDenseE.LoadShM(ShMIn);
 
   IntDefaultsN.LoadShM(ShMIn);
   IntDefaultsE.LoadShM(ShMIn);
   StrDefaultsN.LoadShM(ShMIn);
   StrDefaultsE.LoadShM(ShMIn);
   FltDefaultsE.LoadShM(ShMIn);
   FltDefaultsE.LoadShM(ShMIn);
 
   LoadVecFunctor vec_fn;
   VecOfIntVecsN.LoadShM(ShMIn, vec_fn);
   VecOfIntVecsE.LoadShM(ShMIn, vec_fn);
   /* Strings and floats are complicated, so don't optimize on these */
   VecOfStrVecsN.Load(ShMIn);
   VecOfStrVecsE.Load(ShMIn);
   VecOfFltVecsN.Load(ShMIn);
   VecOfFltVecsE.Load(ShMIn);
 
   LoadVecOfVecFunctor vec_of_vec_fn;
   VecOfIntVecVecsN.LoadShM(ShMIn, vec_of_vec_fn);
   VecOfIntVecVecsE.LoadShM(ShMIn, vec_of_vec_fn);
 
   LoadHashOfVecFunctor hash_of_vec_fn;
   VecOfIntHashVecsN.LoadShM(ShMIn, hash_of_vec_fn);
   VecOfIntHashVecsE.LoadShM(ShMIn, hash_of_vec_fn);
 
   /* Attributes are complicated so load these straight */
   SAttrN.Load(ShMIn);
   SAttrE.Load(ShMIn);
 }

Here is the caller graph for this function:

static PNEANet TNEANet::LoadShM ( TShMIn & ShMIn )

inlinestatic

Static constructor that loads the network from memory.

The object is read-only. It does not support operations that edit the edge vectors of nodes or perform illegal operations on the NodeH, EdgeH (deletion or swapping keys).

Definition at line 2222 of file network.h.

References LoadNetworkShM().

                                         {
     TNEANet* Network = new TNEANet();
     Network->LoadNetworkShM(ShMIn);
     return PNEANet(Network);
   }

Here is the call graph for this function:

static PNEANet TNEANet::New ( )

inlinestatic

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

Definition at line 2176 of file network.h.

Referenced by TTable::BuildGraph(), GetSmallGraph(), KNNJaccard(), KNNJaccardParallel(), TMMNet::ToNetwork(), and TMMNet::ToNetwork2().

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:2097

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1720

Here is the caller graph for this function:

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

inlinestatic

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

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

Definition at line 2180 of file network.h.

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:2097

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1720

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

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

Referenced by AttrNameNI(), and AttrValueNI().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 238 of file network.cpp.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 214 of file network.cpp.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

bool TNEANet::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 222 of file network.cpp.

References THashKeyDatI< TKey, TDat >::GetDat(), THash< TKey, TDat, THashFunc >::GetDat(), THashKeyDatI< TKey, TDat >::GetKey(), THash< TKey, TDat, THashFunc >::GetKeyId(), IntVType, KeyToIndexTypeN, NodeH, and VecOfIntVecVecsN.

Referenced by IsIntVAttrDeletedN(), and NodeAttrIsDeleted().

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

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

Definition at line 230 of file network.cpp.

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

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

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

Here is the call graph for this function:

Here is the caller graph for this function:

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

inline

Definition at line 2271 of file network.h.

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

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

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

inline

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

Definition at line 2634 of file network.h.

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

2634 {

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

THash< TInt, TEdge > EdgeH

Definition: network.h:2029

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:222

THash< TInt, TNode > NodeH

Definition: network.h:2028

Here is the call graph for this function:

void TNEANet::Save ( TSOut & SOut ) const

inline

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

Definition at line 2140 of file network.h.

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

Referenced by TModeNet::Save().

                                {
     MxNId.Save(SOut); MxEId.Save(SOut); NodeH.Save(SOut); EdgeH.Save(SOut);
     KeyToIndexTypeN.Save(SOut); KeyToIndexTypeE.Save(SOut);
     KeyToDenseN.Save(SOut); KeyToDenseE.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);
     VecOfIntHashVecsN.Save(SOut); VecOfIntHashVecsE.Save(SOut); 
     SAttrN.Save(SOut); SAttrE.Save(SOut); }

Here is the call graph for this function:

Here is the caller graph for this function:

void TNEANet::Save_V1 ( TSOut & SOut ) const

inline

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

Definition at line 2154 of file network.h.

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

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

Here is the call graph for this function:

void TNEANet::Save_V2 ( TSOut & SOut ) const

inline

Saves the graph without any sparse data structures. Available for backwards compatibility.

Definition at line 2164 of file network.h.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of str attr names for node NId.

Definition at line 2466 of file network.h.

2466 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::StrAttrNameEI

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

Returns a vector of str attr names for node NId.

Definition: network.h:2466

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

Definition at line 332 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of str attr names for node NId.

Definition at line 2421 of file network.h.

2421 {

2422 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:2421

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2031

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

Definition at line 140 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2470 of file network.h.

Referenced by Dump().

2470 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2031

TNEANet::StrAttrValueEI

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

Returns a vector of attr values for node NId.

Definition: network.h:2470

Here is the caller graph for this function:

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

Definition at line 342 of file network.cpp.

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

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

Here is the call graph for this function:

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

inline

Returns a vector of attr values for node NId.

Definition at line 2425 of file network.h.

Referenced by Dump().

2425 {

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

TIter BegI() const

Definition: hash.h:213

TNEANet::StrAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2425