SNAP Library 6.0, User Reference: TNEANet Class Reference

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

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

Definition at line 308 of file network.cpp.

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

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

inline

Returns a vector of attr names for node NId.

Definition at line 2531 of file network.h.

2531 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

TNEANet::AttrNameNI

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

Returns a vector of attr names for node NId.

Definition: network.h:2531

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

Definition at line 72 of file network.cpp.

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

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2590 of file network.h.

2590 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::AttrValueEI

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

Returns a vector of attr values for edge EId.

Definition: network.h:2590

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

Definition at line 318 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2535 of file network.h.

2535 {

2536 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:2535

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

Definition at line 82 of file network.cpp.

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

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

inline

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

Definition at line 2768 of file network.h.

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

TAFltVI TNEANet::BegEAFltVI ( const TStr & attr ) const

inline

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

Definition at line 2705 of file network.h.

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

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

inline

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

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

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

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

inline

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

Definition at line 2757 of file network.h.

2757 {

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

TNEANet::VecOfStrVecsE

TVec< TStrV > VecOfStrVecsE

Definition: network.h:2064

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

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

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

TIter BegI() const

Definition: hash.h:213

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

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

inline

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

Definition at line 2521 of file network.h.

2521 {

2522 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:2056

TVec::BegI

TIter BegI() const

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

Definition: ds.h:593

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:2065

TVal2 Val2

Definition: ds.h:35

TAFltVI TNEANet::BegNAFltVI ( const TStr & attr ) const

inline

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

Definition at line 2457 of file network.h.

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

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

inline

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

Definition at line 2393 of file network.h.

2393 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:2063

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

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

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

inline

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

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

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

TIter BegI() const

Definition: hash.h:213

TNEANet::DelFromFltVAttrDatN

THash< TInt, TNode > NodeH

Definition: network.h:2053

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

inlineprotected

Definition at line 2116 of file network.h.

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

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

inlineprotected

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

Definition at line 2110 of file network.h.

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

void TNEANet::Clr ( )

inline

Deletes all nodes and edges from the graph.

Definition at line 2836 of file network.h.

              { MxNId=0; MxEId=0; NodeH.Clr(); EdgeH.Clr();
     KeyToIndexTypeN.Clr(); KeyToIndexTypeE.Clr(); IntDefaultsN.Clr(); IntDefaultsE.Clr();
     StrDefaultsN.Clr(); StrDefaultsE.Clr(); FltDefaultsN.Clr(); FltDefaultsE.Clr();
     VecOfIntVecsN.Clr(); VecOfIntVecsE.Clr(); VecOfStrVecsN.Clr(); VecOfStrVecsE.Clr();
     VecOfFltVecsN.Clr(); VecOfFltVecsE.Clr(); VecOfIntVecVecsN.Clr(); VecOfIntVecVecsE.Clr(); 
     VecOfFltVecVecsN.Clr(); VecOfFltVecVecsE.Clr(); 
     SAttrN.Clr(); SAttrE.Clr();}

void TNEANet::ConvertToSparse ( )

inline

Definition at line 2279 of file network.h.

                          { 
     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();
   
     VecLength = VecOfFltVecVecsN.Len();
     if (VecLength != 0) {
       VecOfFltHashVecsN = TVec<THash<TInt, TFltV> >(VecLength);
       for (iter = KeyToIndexTypeN.BegI(); !iter.IsEnd(); iter=iter.Next()) {
         if (iter.GetDat().Val1 == FltVType) {
           TStr attribute = iter.GetKey();
           TInt index = iter.GetDat().Val2();
           for (int i=0; i<VecOfFltVecVecsN[index].Len(); i++) {
             if(VecOfFltVecVecsN[index][i].Len() > 0) {
               VecOfFltHashVecsN[index].AddDat(TInt(i), VecOfFltVecVecsN[index][i]);
             }
           }
           KeyToDenseN.AddDat(attribute, TBool(false));
         }
       }
     }
     VecOfFltVecVecsN.Clr();
 
     VecLength = VecOfFltVecVecsE.Len();
     if (VecLength != 0) {
       VecOfFltHashVecsE = TVec<THash<TInt, TFltV> >(VecLength);
       for (iter = KeyToIndexTypeE.BegI(); !iter.IsEnd(); iter=iter.Next()) {
         if (iter.GetDat().Val1 == FltVType) {
           TStr attribute = iter.GetKey();
           TInt index = iter.GetDat().Val2();
           for (int i=0; i<VecOfFltVecVecsE[index].Len(); i++) {
             if(VecOfFltVecVecsE[index][i].Len() > 0) {
               VecOfFltHashVecsE[index].AddDat(TInt(i), VecOfFltVecVecsE[index][i]);
             }
           }
           KeyToDenseE.AddDat(attribute, TBool(false));
         }
       }
     }
     VecOfFltVecVecsE.Clr();
   }

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

Defragments the graph.

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

Definition at line 901 of file network.cpp.

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

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

inline

Deletes the edge attribute for NodeI.

Definition at line 3009 of file network.h.

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

TNEANet::DelAttrDatE

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

Deletes the edge attribute for NodeI.

Definition: network.h:3009

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

Definition at line 1524 of file network.cpp.

                                                          {
   // TODO(nkhadke): add error checking
   TInt vecType = KeyToIndexTypeE(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = GetIntAttrDefaultE(attr);
   } else if (vecType == StrType) {
     VecOfStrVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = GetStrAttrDefaultE(attr);
   } else if (vecType == FltType) {
     VecOfFltVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = GetFltAttrDefaultE(attr);
   } else if (vecType == IntVType) {
     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 if (vecType == FltVType) {
     TInt location = CheckDenseOrSparseE(attr);
     if (location == 0) VecOfFltHashVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = TFltV();
     else VecOfFltVecVecsE[KeyToIndexTypeE.GetDat(attr).Val2][EdgeH.GetKeyId(EId)] = TFltV();
   } else {
     return -1;
   }
   return 0;
 }

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

inline

Deletes the node attribute for NodeI.

Definition at line 3006 of file network.h.

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

TNEANet::DelAttrDatN

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

Deletes the node attribute for NodeI.

Definition: network.h:3006

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

Definition at line 1502 of file network.cpp.

                                                          {
   TInt vecType = KeyToIndexTypeN(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = GetIntAttrDefaultN(attr);
   } else if (vecType == StrType) {
     VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = GetStrAttrDefaultN(attr);
   } else if (vecType == FltType) {
     VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = GetFltAttrDefaultN(attr);
   } else if (vecType ==IntVType) {
     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 if (vecType == FltVType) { // added by Avery
     TInt location = CheckDenseOrSparseN(attr);
     if (location == 0) VecOfFltHashVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = TFltV();
     else VecOfFltVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2][NodeH.GetKeyId(NId)] = TFltV();
   } else {
     return -1;
   }
   return 0;
 }

int TNEANet::DelAttrE ( const TStr & attr )

Removes all the values for edge attr.

Definition at line 1769 of file network.cpp.

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

int TNEANet::DelAttrN ( const TStr & attr )

Removes all the values for node attr.

Definition at line 1735 of file network.cpp.

                                       {
   TInt vecType = KeyToIndexTypeN(attr).Val1;
   if (vecType == IntType) {
     VecOfIntVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TInt>();
     if (IntDefaultsN.IsKey(attr)) {
       IntDefaultsN.DelKey(attr);
     }
   } else if (vecType == StrType) {
     VecOfStrVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TStr>();  
     if (StrDefaultsN.IsKey(attr)) {
       StrDefaultsN.DelKey(attr);
     }
   } else if (vecType == FltType) {
     VecOfFltVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TFlt>();
     if (FltDefaultsN.IsKey(attr)) {
       FltDefaultsN.DelKey(attr);
     }
   } else if (vecType == IntVType) {
     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 if (vecType == FltVType) {
     TInt location = CheckDenseOrSparseN(attr);
     if (location == 1) VecOfFltVecVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = TVec<TFltV>();
     else VecOfFltHashVecsN[KeyToIndexTypeN.GetDat(attr).Val2] = THash<TInt, TFltV>();
     KeyToDenseN.DelKey(attr);
   } else {
     return -1;
   }
   KeyToIndexTypeN.DelKey(attr);
   return 0;
 }

void TNEANet::DelEdge ( const int & EId )

Deletes an edge with edge ID EId from the graph.

Definition at line 828 of file network.cpp.

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

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

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

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

Definition at line 856 of file network.cpp.

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

int TNEANet::DelFromFltVAttrDatN	(	const TNodeI &	NodeI,
		const TFlt &	value,
		const TStr &	attr
	)

inline

Deletes value from the TFltV attribute for the given node.

Definition at line 2890 of file network.h.

2890 { return DelFromFltVAttrDatN(NodeI.GetId(), value, attr); }

int DelFromFltVAttrDatN(const TNodeI &NodeI, const TFlt &value, const TStr &attr)

Deletes value from the TFltV attribute for the given node.

Definition: network.h:2890

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

Definition at line 1176 of file network.cpp.

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

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

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

TNEANet::DelFromIntVAttrDatN

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

Deletes value from the TIntV attribute for the given node.

Definition: network.h:2883

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

Definition at line 1150 of file network.cpp.

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

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

                                     {
   int i;
   TInt Id(NId);
   SAttrN.DelSAttrId(Id);
   const TNode& Node = GetNode(NId);
   for (int out = 0; out < Node.GetOutDeg(); out++) {
     const int EId = Node.GetOutEId(out);
     const TEdge& Edge = GetEdge(EId);
     IAssert(Edge.GetSrcNId() == NId);
     GetNode(Edge.GetDstNId()).InEIdV.DelIfIn(EId);
     // Delete from Edge Attributes
     for (i = 0; i < VecOfIntVecsE.Len(); i++) {
       TVec<TInt>& IntVec = VecOfIntVecsE[i];
       IntVec[EdgeH.GetKeyId(EId)] = TInt::Mn;
     }
     for (i = 0; i < VecOfStrVecsE.Len(); i++) {
       TVec<TStr>& StrVec = VecOfStrVecsE[i];
       StrVec[EdgeH.GetKeyId(EId)] = TStr::GetNullStr();
     }
     for (i = 0; i < VecOfFltVecsE.Len(); i++) {
       TVec<TFlt>& FltVec = VecOfFltVecsE[i];
       FltVec[EdgeH.GetKeyId(EId)] = TFlt::Mn;
     }
     for (i = 0; i < VecOfIntVecVecsE.Len(); i++) {
       TVec<TIntV>& IntVecV = VecOfIntVecVecsE[i];
       IntVecV[EdgeH.GetKeyId(EId)] = TIntV();
     }
     for (i = 0; i < VecOfFltVecVecsE.Len(); i++) {
       TVec<TFltV>& FltVecV = VecOfFltVecVecsE[i];
       FltVecV[EdgeH.GetKeyId(EId)] = TFltV();
     }
     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 (i = 0; i < VecOfFltHashVecsE.Len(); i++) {
       THash<TInt, TFltV>& FltHashV = VecOfFltHashVecsE[i];
       if (FltHashV.IsKey(EdgeH.GetKeyId(EId))) {
         FltHashV.DelKey(EdgeH.GetKeyId(EId));
       }
     }
     EdgeH.DelKey(EId);
     
   }
   for (int in = 0; in < Node.GetInDeg(); in++) {
     const int EId = Node.GetInEId(in);
     const TEdge& Edge = GetEdge(EId);
     IAssert(Edge.GetDstNId() == NId);
     GetNode(Edge.GetSrcNId()).OutEIdV.DelIfIn(EId);
     // Delete from Edge Attributes
     for (i = 0; i < VecOfIntVecsE.Len(); i++) {
       TVec<TInt>& IntVec = VecOfIntVecsE[i];
       IntVec[EdgeH.GetKeyId(EId)] = TInt::Mn;
     }
     for (i = 0; i < VecOfStrVecsE.Len(); i++) {
       TVec<TStr>& StrVec = VecOfStrVecsE[i];
       StrVec[EdgeH.GetKeyId(EId)] = TStr::GetNullStr();
     }
     for (i = 0; i < VecOfFltVecsE.Len(); i++) {
       TVec<TFlt>& FltVec = VecOfFltVecsE[i];
       FltVec[EdgeH.GetKeyId(EId)] = TFlt::Mn;
     }
     for (i = 0; i < VecOfIntVecVecsE.Len(); i++) {
       TVec<TIntV>& IntVecV = VecOfIntVecVecsE[i];
       IntVecV[EdgeH.GetKeyId(EId)] = TIntV();
     }
     for (i = 0; i < VecOfFltVecVecsE.Len(); i++) {
       TVec<TFltV>& FltVecV = VecOfFltVecVecsE[i];
       FltVecV[EdgeH.GetKeyId(EId)] = TFltV();
     }
     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 (i = 0; i < VecOfFltHashVecsE.Len(); i++) {
       THash<TInt, TFltV>& FltHashV = VecOfFltHashVecsE[i];
       if (FltHashV.IsKey(EdgeH.GetKeyId(EId))) {
         FltHashV.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 < VecOfFltVecVecsN.Len(); i++) {
     TVec<TFltV>& FltVecV = VecOfFltVecVecsN[i];
     FltVecV[NodeH.GetKeyId(NId)] = TFltV();
   }
   for (i = 0; i < VecOfIntHashVecsN.Len(); i++) {
     THash<TInt, TIntV>& IntHashV = VecOfIntHashVecsN[i];
     if (IntHashV.IsKey(NodeH.GetKeyId(NId))) {
       IntHashV.DelKey(NodeH.GetKeyId(NId));
     }
   }
   for (i = 0; i < VecOfFltHashVecsN.Len(); i++) {
     THash<TInt, TFltV>& FltHashV = VecOfFltHashVecsN[i];
     if (FltHashV.IsKey(NodeH.GetKeyId(NId))) {
       FltHashV.DelKey(NodeH.GetKeyId(NId));
     }
   }
   NodeH.DelKey(NId);
 }

void TNEANet::DelNode ( const TNode & NodeI )

inline

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

Definition at line 2383 of file network.h.

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

TNEANet::DelNode

virtual void DelNode(const int &NId)

Deletes node of ID NId from the graph.

Definition: network.cpp:631

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

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

Definition at line 2075 of file network.cpp.

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

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

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

Definition at line 2082 of file network.cpp.

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

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

inline

Deletes sparse attribute with name AttrName from EdgeI.

Definition at line 3327 of file network.h.

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

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

inline

Deletes sparse attribute with id AttrId from EdgeI.

Definition at line 3331 of file network.h.

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

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

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

Definition at line 1949 of file network.cpp.

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

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

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

Definition at line 1956 of file network.cpp.

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

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

inline

Deletes sparse attribute with name AttrName from NodeI.

Definition at line 3209 of file network.h.

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

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

inline

Deletes sparse attribute with id AttrId from NodeI.

Definition at line 3213 of file network.h.

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

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

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

Definition at line 963 of file network.cpp.

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

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

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

Definition at line 482 of file network.cpp.

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

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

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

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

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

Definition at line 503 of file network.cpp.

                                                                                        {
   return (EdgeHI.GetDat().Val1 == FltVType &&
     TFltV() == this->VecOfFltVecVecsE.GetVal(
     this->KeyToIndexTypeE.GetDat(EdgeHI.GetKey()).Val2).GetVal(EdgeH.GetKeyId(EId)));
 }

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

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

Definition at line 491 of file network.cpp.

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

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

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

Definition at line 497 of file network.cpp.

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

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

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

Definition at line 509 of file network.cpp.

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

bool TNEANet::Empty ( ) const

inline

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

Definition at line 2834 of file network.h.

2834 { return GetNodes()==0; }

TNEANet::GetNodes

int GetNodes() const

Returns the number of nodes in the network.

Definition: network.h:2363

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

inline

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

Definition at line 2772 of file network.h.

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

TAFltVI TNEANet::EndEAFltVI ( const TStr & attr ) const

inline

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

Definition at line 2722 of file network.h.

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

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

inline

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

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

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

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

inline

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

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

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

THash::EndI

TIter EndI() const

Definition: hash.h:218

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

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

inline

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

Definition at line 2524 of file network.h.

2524 {

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

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

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:2065

TVal2 Val2

Definition: ds.h:35

TAFltVI TNEANet::EndNAFltVI ( const TStr & attr ) const

inline

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

Definition at line 2474 of file network.h.

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

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

inline

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

Definition at line 2396 of file network.h.

2396 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:2063

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

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

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

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

inline

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

Definition at line 2515 of file network.h.

2515 {

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

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

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

THash::EndI

TIter EndI() const

Definition: hash.h:218

THash< TInt, TNode > NodeH

Definition: network.h:2053

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2631 of file network.h.

2631 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::FltAttrNameEI

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

Returns a vector of int attr names for node NId.

Definition: network.h:2631

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

Definition at line 432 of file network.cpp.

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

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2577 of file network.h.

2577 {

2578 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:2577

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

Definition at line 196 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2635 of file network.h.

2635 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::FltAttrValueEI

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

Returns a vector of attr values for node NId.

Definition: network.h:2635

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

Definition at line 442 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2581 of file network.h.

2581 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

TNEANet::FltAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2581

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

Definition at line 206 of file network.cpp.

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

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

inline

Returns a vector of flt attr names for edge EId.

Definition at line 2613 of file network.h.

2613 {

2614 FltVAttrNameEI(EId, KeyToIndexTypeE.BegI(), Names);}

TIter BegI() const

Definition: hash.h:213

TNEANet::FltVAttrNameEI

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

Returns a vector of flt attr names for edge EId.

Definition: network.h:2613

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

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

Definition at line 380 of file network.cpp.

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

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

inline

Returns a vector of flt attr names for node NId.

Definition at line 2559 of file network.h.

2559 {

2560 FltVAttrNameNI(NId, KeyToIndexTypeN.BegI(), Names);}

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

TNEANet::FltVAttrNameNI

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

Returns a vector of flt attr names for node NId.

Definition: network.h:2559

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

Definition at line 144 of file network.cpp.

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

void TNEANet::FltVAttrValueEI	(	const TInt &	EId,
		TVec< TFltV > &	Values
	)		const

inline

Returns a vector of attr values for edge EId.

Definition at line 2617 of file network.h.

2617 {

2618 FltVAttrValueEI(EId, KeyToIndexTypeE.BegI(), Values);}

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::FltVAttrValueEI

void FltVAttrValueEI(const TInt &EId, TVec< TFltV > &Values) const

Returns a vector of attr values for edge EId.

Definition: network.h:2617

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

Definition at line 390 of file network.cpp.

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

void TNEANet::FltVAttrValueNI	(	const TInt &	NId,
		TVec< TFltV > &	Values
	)		const

inline

Returns a vector of flt values for node NId.

Definition at line 2563 of file network.h.

2563 {

2564 FltVAttrValueNI(NId, KeyToIndexTypeN.BegI(), Values);}

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

TNEANet::FltVAttrValueNI

void FltVAttrValueNI(const TInt &NId, TVec< TFltV > &Values) const

Returns a vector of flt values for node NId.

Definition: network.h:2563

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

Definition at line 154 of file network.cpp.

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

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

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

Definition at line 1817 of file network.cpp.

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

int TNEANet::GetAttrIndE ( const TStr & attr )

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

Definition at line 1497 of file network.cpp.

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

int TNEANet::GetAttrIndN ( const TStr & attr )

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

Definition at line 1452 of file network.cpp.

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

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

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

Definition at line 1803 of file network.cpp.

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

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

inline

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

Definition at line 2776 of file network.h.

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

TAFltVI TNEANet::GetEAFltVI	(	const TStr &	attr,
		const int &	EId
	)		const

inline

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

Definition at line 2739 of file network.h.

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

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

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

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

inline

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

Definition at line 2687 of file network.h.

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

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

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

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

inlineprotected

Definition at line 2032 of file network.h.

2032 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

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

inlineprotected

Definition at line 2033 of file network.h.

2033 { return EdgeH.GetDat(EId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

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

Returns edge attribute value, converted to Str type.

Definition at line 521 of file network.cpp.

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

int TNEANet::GetEdges ( ) const

inline

Returns the number of edges in the graph.

Definition at line 2785 of file network.h.

2785 { return EdgeH.Len(); }

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

THash::Len

int Len() const

Definition: hash.h:228

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

inline

Returns an iterator referring to edge with edge ID EId.

Definition at line 2816 of file network.h.

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

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

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

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

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

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

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

void TNEANet::GetEIdV ( TIntV & EIdV ) const

Gets a vector IDs of all edges in the graph.

Definition at line 894 of file network.cpp.

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

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

inline

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

Definition at line 2975 of file network.h.

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

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

Definition at line 1477 of file network.cpp.

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

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

inline

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

Definition at line 2938 of file network.h.

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

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

Definition at line 1432 of file network.cpp.

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

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

inlineprotected

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

Definition at line 2048 of file network.h.

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

TNEANet::FltDefaultsE

THash< TStr, TFlt > FltDefaultsE

Definition: network.h:2062

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TFlt

Definition: dt.h:1386

bool IsKey(const TKey &Key) const

Definition: hash.h:258

TFlt::Mn

static const double Mn

Definition: dt.h:1390

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

inlineprotected

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

Definition at line 2042 of file network.h.

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

TNEANet::FltDefaultsN

THash< TStr, TFlt > FltDefaultsN

Definition: network.h:2062

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TFlt

Definition: dt.h:1386

TNEANet::GetFltAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:258

TFlt::Mn

static const double Mn

Definition: dt.h:1390

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

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

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

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

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

inline

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

Definition at line 2964 of file network.h.

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

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

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

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

Gets Vector for the Flt Attribute attr.

Definition at line 1403 of file network.cpp.

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

int TNEANet::GetFltKeyIdE ( const int & EId )

Gets keyid for edge with id EId.

Definition at line 1407 of file network.cpp.

                                         {
   return EdgeH.GetKeyId(EId);
 }

TFltV TNEANet::GetFltVAttrDatE	(	const TEdgeI &	EdgeI,
		const TStr &	attr
	)

inline

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

Definition at line 2982 of file network.h.

2982 { return GetFltVAttrDatE(EdgeI.GetId(), attr); }

TNEANet::GetFltVAttrDatE

TFltV GetFltVAttrDatE(const TEdgeI &EdgeI, const TStr &attr)

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

Definition: network.h:2982

TFltV TNEANet::GetFltVAttrDatE	(	const int &	EId,
		const TStr &	attr
	)

Definition at line 1467 of file network.cpp.

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

TFltV TNEANet::GetFltVAttrDatN	(	const TNodeI &	NodeI,
		const TStr &	attr
	)		const

inline

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

Definition at line 2945 of file network.h.

2945 { return GetFltVAttrDatN(NodeI.GetId(), attr); }

TNEANet::GetFltVAttrDatN

TFltV GetFltVAttrDatN(const TNodeI &NodeI, const TStr &attr) const

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

Definition: network.h:2945

TFltV TNEANet::GetFltVAttrDatN	(	const int &	NId,
		const TStr &	attr
	)		const

Definition at line 1422 of file network.cpp.

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

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

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

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

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

Definition at line 2101 of file network.cpp.

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

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

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

Definition at line 1971 of file network.cpp.

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

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

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

Definition at line 1975 of file network.cpp.

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

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

inline

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

Definition at line 2969 of file network.h.

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

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

Definition at line 1456 of file network.cpp.

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

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

inline

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

Definition at line 2931 of file network.h.

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

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

Definition at line 1411 of file network.cpp.

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

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

inlineprotected

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

Definition at line 2044 of file network.h.

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

TNEANet::IntDefaultsE

THash< TStr, TInt > IntDefaultsE

Definition: network.h:2060

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TInt::Mn

static const int Mn

Definition: dt.h:1141

TInt

Definition: dt.h:1137

bool IsKey(const TKey &Key) const

Definition: hash.h:258

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

inlineprotected

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

Definition at line 2038 of file network.h.

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

TInt

Definition: dt.h:1137

TNEANet::IntDefaultsN

THash< TStr, TInt > IntDefaultsN

Definition: network.h:2060

TNEANet::GetIntAttrIndDatE

bool IsKey(const TKey &Key) const

Definition: hash.h:258

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

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

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

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

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

inline

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

Definition at line 2954 of file network.h.

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

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

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

int TNEANet::GetIntAttrIndE ( const TStr & attr )

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

Definition at line 1493 of file network.cpp.

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

int TNEANet::GetIntAttrIndN ( const TStr & attr )

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

Definition at line 1448 of file network.cpp.

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

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

inline

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

Definition at line 2978 of file network.h.

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

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

Definition at line 1460 of file network.cpp.

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

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

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

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

Definition at line 1415 of file network.cpp.

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

int TNEANet::GetMxEId ( ) const

inline

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

Definition at line 2782 of file network.h.

2782 { return MxEId; }

TNEANet::MxEId

TInt MxEId

Definition: network.h:2052

int TNEANet::GetMxNId ( ) const

inline

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

Definition at line 2780 of file network.h.

2780 { return MxNId; }

TNEANet::MxNId

TInt MxNId

Definition: network.h:2052

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

2527 {

2528 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:2056

THash::GetKeyId

int GetKeyId(const TKey &Key) const

Definition: hash.h:466

TNEANet::VecOfFltVecsN

TVec< TFltV > VecOfFltVecsN

Definition: network.h:2065

TVal2 Val2

Definition: ds.h:35

THash< TInt, TNode > NodeH

Definition: network.h:2053

TVec::GetI

TIter GetI(const TSizeTy &ValN) const

Returns an iterator an element at position ValN.

Definition: ds.h:597

TAFltVI TNEANet::GetNAFltVI	(	const TStr &	attr,
		const int &	NId
	)		const

inline

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

Definition at line 2493 of file network.h.

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

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

2399 {

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

TNEANet::VecOfIntVecsN

TVec< TIntV > VecOfIntVecsN

Definition: network.h:2063

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

TVec::GetI

TIter GetI(const TSizeTy &ValN) const

Returns an iterator an element at position ValN.

Definition: ds.h:597

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

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

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

2518 {

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

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

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

inline

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

Definition at line 2391 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:2053

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:220

void TNEANet::GetNIdV ( TIntV & NIdV ) const

Gets a vector IDs of all nodes in the graph.

Definition at line 887 of file network.cpp.

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

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

inlineprotected

Definition at line 2030 of file network.h.

2030 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:2053

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

inlineprotected

Definition at line 2031 of file network.h.

2031 { return NodeH.GetDat(NId); }

const TDat & GetDat(const TKey &Key) const

Definition: hash.h:262

THash< TInt, TNode > NodeH

Definition: network.h:2053

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

Returns node attribute value, converted to Str type.

Definition at line 294 of file network.cpp.

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

int TNEANet::GetNodes ( ) const

inline

Returns the number of nodes in the network.

Definition at line 2363 of file network.h.

2363 { return NodeH.Len(); }

THash< TInt, TNode > NodeH

Definition: network.h:2053

THash::Len

int Len() const

Definition: hash.h:228

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

inline

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

Definition at line 2827 of file network.h.

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

TNEANet::GetRndEId

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

Returns an ID of a random edge in the graph.

Definition: network.h:2825

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

inline

Returns an ID of a random edge in the graph.

Definition at line 2825 of file network.h.

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

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

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

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

inline

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

Definition at line 2823 of file network.h.

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

TNEANet::GetNI

TNodeI GetNI(const int &NId) const

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

Definition: network.h:2391

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

inline

Returns an ID of a random node in the graph.

Definition at line 2821 of file network.h.

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

THash< TInt, TNode > NodeH

Definition: network.h:2053

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

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

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

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

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

Definition at line 2040 of file network.cpp.

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

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

inline

Gets Int sparse attribute with name AttrName from EdgeI.

Definition at line 3285 of file network.h.

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

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

inline

Gets Int sparse attribute with id AttrId from EdgeI.

Definition at line 3289 of file network.h.

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

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

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

Definition at line 2047 of file network.cpp.

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

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

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

Definition at line 2054 of file network.cpp.

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

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

inline

Gets Flt sparse attribute with name AttrName from EdgeI.

Definition at line 3299 of file network.h.

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

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

inline

Gets Flt sparse attribute with id AttrId from EdgeI.

Definition at line 3303 of file network.h.

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

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

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

Definition at line 2061 of file network.cpp.

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

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

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

Definition at line 2068 of file network.cpp.

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

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

inline

Gets Str sparse attribute with name AttrName from EdgeI.

Definition at line 3313 of file network.h.

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

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

inline

Gets Str sparse attribute with id AttrId from EdgeI.

Definition at line 3317 of file network.h.

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

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

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

Definition at line 1907 of file network.cpp.

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

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

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

Definition at line 1914 of file network.cpp.

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

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

inline

Gets Int sparse attribute with name AttrName from NodeI.

Definition at line 3167 of file network.h.

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

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

inline

Gets Int sparse attribute with id AttrId from NodeI.

Definition at line 3171 of file network.h.

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

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

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

Definition at line 1921 of file network.cpp.

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

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

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

Definition at line 1928 of file network.cpp.

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

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

inline

Gets Flt sparse attribute with name AttrName from NodeI.

Definition at line 3181 of file network.h.

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

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

inline

Gets Flt sparse attribute with id AttrId from NodeI.

Definition at line 3185 of file network.h.

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

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

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

Definition at line 1935 of file network.cpp.

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

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

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

Definition at line 1942 of file network.cpp.

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

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

inline

Gets Str sparse attribute with name AttrName from NodeI.

Definition at line 3195 of file network.h.

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

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

inline

Gets Str sparse attribute with id AttrId from NodeI.

Definition at line 3199 of file network.h.

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

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

Gets id and type for attribute with name Name.

Definition at line 2109 of file network.cpp.

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

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

Gets id and type for attribute with name Name.

Definition at line 1983 of file network.cpp.

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

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

Gets name and type for attribute with id AttrId.

Definition at line 2113 of file network.cpp.

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

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

Gets name and type for attribute with id AttrId.

Definition at line 1987 of file network.cpp.

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

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

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

Definition at line 2089 of file network.cpp.

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

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

inline

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

Definition at line 3337 of file network.h.

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

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

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

Definition at line 1963 of file network.cpp.

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

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

inline

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

Definition at line 3220 of file network.h.

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

PNEANet TNEANet::GetSmallGraph ( )

static

Returns a small multigraph on 5 nodes and 6 edges.

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

Definition at line 1794 of file network.cpp.

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

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

inline

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

Definition at line 2972 of file network.h.

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

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

Definition at line 1473 of file network.cpp.

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

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

inline

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

Definition at line 2935 of file network.h.

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

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

Definition at line 1428 of file network.cpp.

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

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

inlineprotected

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

Definition at line 2046 of file network.h.

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

TStr

Definition: dt.h:412

bool IsKey(const TKey &Key) const

Definition: hash.h:258

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

inlineprotected

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

Definition at line 2040 of file network.h.

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

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

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

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

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

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

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

inline

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

Definition at line 2959 of file network.h.

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

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

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

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

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

Definition at line 1831 of file network.cpp.

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

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

Fills OutWeights with the outgoing weight from each node.

Definition at line 1842 of file network.cpp.

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

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

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

Definition at line 50 of file network.cpp.

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

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

inline

Returns a vector of int attr names for edge EId.

Definition at line 2594 of file network.h.

2594 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::IntAttrNameEI

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

Returns a vector of int attr names for edge EId.

Definition: network.h:2594

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

Definition at line 328 of file network.cpp.

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

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2540 of file network.h.

2540 {

2541 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:2540

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

Definition at line 92 of file network.cpp.

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

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2598 of file network.h.

2598 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::IntAttrValueEI

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

Returns a vector of attr values for edge EId.

Definition: network.h:2598

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

Definition at line 338 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2544 of file network.h.

2544 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

TNEANet::IntAttrValueNI

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

Returns a vector of attr values for node NId.

Definition: network.h:2544

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

Definition at line 102 of file network.cpp.

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

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

inline

Returns a vector of int attr names for edge EId.

Definition at line 2604 of file network.h.

2604 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::IntVAttrNameEI

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

Returns a vector of int attr names for edge EId.

Definition: network.h:2604

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

Definition at line 349 of file network.cpp.

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

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

inline

Returns a vector of int attr names for node NId.

Definition at line 2550 of file network.h.

2550 {

2551 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:2550

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

Definition at line 113 of file network.cpp.

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

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

inline

Returns a vector of attr values for edge EId.

Definition at line 2608 of file network.h.

2608 {

2609 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:2608

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

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

Definition at line 359 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2554 of file network.h.

2554 {

2555 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:2554

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

Definition at line 123 of file network.cpp.

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

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

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

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

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

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

inline

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

Definition at line 2804 of file network.h.

2804 { return EdgeH.IsKey(EId); }

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

bool IsKey(const TKey &Key) const

Definition: hash.h:258

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

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

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

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

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

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

Definition at line 478 of file network.cpp.

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

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

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

Definition at line 242 of file network.cpp.

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

bool TNEANet::IsFltAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1850 of file network.cpp.

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

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

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

Definition at line 470 of file network.cpp.

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

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

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

Definition at line 234 of file network.cpp.

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

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

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

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

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

Definition at line 226 of file network.cpp.

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

bool TNEANet::IsIntAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1855 of file network.cpp.

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

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

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

Definition at line 466 of file network.cpp.

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

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

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

Definition at line 230 of file network.cpp.

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

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

inline

Tests whether ID NId is a node.

Definition at line 2385 of file network.h.

2385 { return NodeH.IsKey(NId); }

THash< TInt, TNode > NodeH

Definition: network.h:2053

bool IsKey(const TKey &Key) const

Definition: hash.h:258

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

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

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

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

Definition at line 474 of file network.cpp.

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

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

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

Definition at line 238 of file network.cpp.

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

bool TNEANet::IsStrAttrE ( const TStr & attr )

Checks if there is an edge attribute with name attr.

Definition at line 1860 of file network.cpp.

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

static PNEANet TNEANet::Load ( TSIn & SIn )

inlinestatic

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

Definition at line 2232 of file network.h.

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:2124

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 2234 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 2249 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->VecOfFltVecVecsN.Load(SIn); Graph->VecOfFltVecVecsE.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.

                                           {
   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);
   VecOfFltVecVecsN.LoadShM(ShMIn, vec_of_vec_fn);
   VecOfFltVecVecsE.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);
   VecOfFltHashVecsN.LoadShM(ShMIn, hash_of_vec_fn);
   VecOfFltHashVecsE.LoadShM(ShMIn, hash_of_vec_fn);
 
   /* Attributes are complicated so load these straight */
   SAttrN.Load(ShMIn);
   SAttrE.Load(ShMIn);
 }

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

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

static PNEANet TNEANet::New ( )

inlinestatic

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

Definition at line 2226 of file network.h.

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:2124

PNEANet

TPt< TNEANet > PNEANet

Pointer to a directed attribute multigraph (TNEANet)

Definition: network.h:1720

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

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

TNEANet::TNEANet

TNEANet()

Definition: network.h:2124

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

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

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

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

Definition at line 286 of file network.cpp.

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

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

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

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

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

Definition at line 254 of file network.cpp.

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

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

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

Definition at line 262 of file network.cpp.

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

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

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

Definition at line 278 of file network.cpp.

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

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

inline

Definition at line 2358 of file network.h.

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

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

inline

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

Definition at line 2844 of file network.h.

2844 {

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

THash< TInt, TEdge > EdgeH

Definition: network.h:2054

THash::Gen

void Gen(const int &ExpectVals)

Definition: hash.h:222

THash< TInt, TNode > NodeH

Definition: network.h:2053

void TNEANet::Save ( TSOut & SOut ) const

inline

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

Definition at line 2187 of file network.h.

                                {
     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);
     VecOfFltVecVecsN.Save(SOut); VecOfFltVecVecsE.Save(SOut); 
     VecOfIntHashVecsN.Save(SOut); VecOfIntHashVecsE.Save(SOut); 
     VecOfFltHashVecsN.Save(SOut); VecOfFltHashVecsE.Save(SOut); 
     SAttrN.Save(SOut); SAttrE.Save(SOut); }

void TNEANet::Save_V1 ( TSOut & SOut ) const

inline

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

Definition at line 2203 of file network.h.

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

void TNEANet::Save_V2 ( TSOut & SOut ) const

inline

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

Definition at line 2213 of file network.h.

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

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

inline

Returns a vector of str attr names for node NId.

Definition at line 2623 of file network.h.

2623 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::StrAttrNameEI

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

Returns a vector of str attr names for node NId.

Definition: network.h:2623

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

Definition at line 411 of file network.cpp.

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

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

inline

Returns a vector of str attr names for node NId.

Definition at line 2569 of file network.h.

2569 {

2570 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:2569

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeN

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

Definition: network.h:2056

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

Definition at line 175 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2627 of file network.h.

2627 {

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

TIter BegI() const

Definition: hash.h:213

TStrIntPrH KeyToIndexTypeE

Definition: network.h:2056

TNEANet::StrAttrValueEI

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

Returns a vector of attr values for node NId.

Definition: network.h:2627

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

Definition at line 421 of file network.cpp.

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

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

inline

Returns a vector of attr values for node NId.

Definition at line 2573 of file network.h.

2573 {

2574 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:2573