SNAP Library 3.0, User Reference: TModeNet Class Reference

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

TModeNet::TModeNet ( const int & TypeId )

inline

Definition at line 52 of file mmnet.h.

52 : TNEANet(), ModeId(TypeId), MMNet(), NeighborTypes() { }

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

TModeNet::TModeNet	(	const int &	Nodes,
		const int &	Edges
	)

inlineexplicit

Constructor that reserves enough memory for a graph of nodes and edges.

Definition at line 54 of file mmnet.h.

54 : TNEANet(Nodes, Edges),

55 ModeId(-1), MMNet(), NeighborTypes(){ }

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

TModeNet::TModeNet	(	const int &	Nodes,
		const int &	Edges,
		const int &	TypeId
	)

inlineexplicit

Definition at line 56 of file mmnet.h.

56 : TNEANet(Nodes, Edges),

57 ModeId(TypeId), MMNet(), NeighborTypes() { }

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

TModeNet::TModeNet ( const TModeNet & Graph )

inline

Definition at line 58 of file mmnet.h.

58 : TNEANet(true, Graph), ModeId(Graph.ModeId), MMNet(Graph.MMNet), NeighborTypes(Graph.NeighborTypes) { }

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

TModeNet::TModeNet ( TSIn & SIn )

inline

Constructor for loading the graph from a (binary) stream SIn.

Definition at line 60 of file mmnet.h.

60 : TNEANet(SIn), ModeId(SIn), MMNet(), NeighborTypes(SIn) { }

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

TModeNet::TModeNet	(	const TModeNet &	Graph,
		bool	isSubModeGraph
	)

inlineprivate

Definition at line 62 of file mmnet.h.

62 : TNEANet(Graph, isSubModeGraph), ModeId(Graph.ModeId), MMNet(), NeighborTypes() {}

TMMNet * MMNet

Definition: mmnet.h:47

TInt ModeId

Definition: mmnet.h:46

TNEANet()

Definition: network.h:1880

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

Member Function Documentation

int TModeNet::AddIntVAttrByVecN	(	const TStr &	attr,
		TVec< TIntV > &	Attrs
	)

private

Adds a new TIntV node attribute to the hashmap.

Definition at line 117 of file mmnet.cpp.

                                                                    {
   TInt CurrLen;
   TVec<TIntV> NewVec;
   CurrLen = VecOfIntVecVecsN.Len();
   KeyToIndexTypeN.AddDat(attr, TIntPr(IntVType, CurrLen));
   VecOfIntVecVecsN.Add(Attrs);
   return 0;
 }

int TModeNet::AddNbrType	(	const TStr &	CrossName,
		const bool	sameMode,
		bool	isDir
	)

private

Definition at line 82 of file mmnet.cpp.

                                                                                {
   //IAssertR(!NeighborTypes.IsKey(CrossName),TStr::Fmt("Neighbor Cross Types already exists: %s", CrossName.CStr()));
   if (NeighborTypes.IsKey(CrossName)) { return -1; } //Don't want to add nbr type multiple times
   bool hasSingleVector = (!isDir || !sameMode);
   NeighborTypes.AddDat(CrossName, hasSingleVector);
   return 0;
 }

int TModeNet::AddNeighbor	(	const int &	NId,
		const int &	EId,
		const bool	outEdge,
		const int	linkId,
		const bool	sameMode,
		bool	isDir
	)

private

Definition at line 31 of file mmnet.cpp.

                                                                                                                         {
   TStr CrossName = MMNet->GetCrossName(linkId);
   return AddNeighbor(NId, EId, outEdge, CrossName, sameMode, isDir);
 }

int TModeNet::AddNeighbor	(	const int &	NId,
		const int &	EId,
		const bool	outEdge,
		const TStr &	linkName,
		const bool	sameMode,
		bool	isDir
	)

private

Definition at line 36 of file mmnet.cpp.

                                                                                                                              {
   if (!NeighborTypes.IsKey(CrossName)) {
     AddNbrType(CrossName, sameMode, isDir);
   }
   TStr Name = GetNeighborCrossName(CrossName, outEdge, sameMode, isDir);
   return AppendIntVAttrDatN(NId, EId, Name); 
 }

TNodeI TModeNet::BegMMNI ( ) const

inline

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

Definition at line 76 of file mmnet.h.

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

THash::BegI

TIter BegI() const

Definition: hash.h:171

TNEANet::NodeH

THash< TInt, TNode > NodeH

Definition: network.h:1862

void TModeNet::Clr ( )

Deletes all nodes from this mode and edges from associated crossnets.

Definition at line 22 of file mmnet.cpp.

                    {
   TStrV CNets;
   NeighborTypes.GetKeyV(CNets);
   for (int i=0; i < CNets.Len(); i++) {
     MMNet->GetCrossNetByName(CNets[i]).Clr();
   }
   TNEANet::Clr();
 }

void TModeNet::ClrNbr	(	const TStr &	CrossNetName,
		const bool &	outEdge,
		const bool &	sameMode,
		bool &	isDir
	)

private

Definition at line 15 of file mmnet.cpp.

                                                                                                       {
   TStr Name = GetNeighborCrossName(CrossNetName, outEdge, sameMode, isDir);
   TVec<TIntV> Attrs(MxNId);
   int index = KeyToIndexTypeN.GetDat(Name).Val2;
   VecOfIntVecVecsN[index] = Attrs;
 }

int TModeNet::DelNbrType ( const TStr & CrossName )

private

Definition at line 90 of file mmnet.cpp.

                                               {
   //IAssertR(!NeighborTypes.IsKey(CrossName),TStr::Fmt("Neighbor Cross Types already exists: %s", CrossName.CStr()));
   bool hasSingleVector = NeighborTypes.GetDat(CrossName);
   NeighborTypes.DelKey(CrossName);
   if (hasSingleVector) {
     return DelAttrN(CrossName);
   } else {
     TStr InName = GetNeighborCrossName(CrossName, true, true, true);
     TStr OutName = GetNeighborCrossName(CrossName, false, true, true);
     if (DelAttrN(InName) == -1 || DelAttrN(OutName) == -1) {
       return -1;
     }
   }
   return 0;
 }

int TModeNet::DelNeighbor	(	const int &	NId,
		const int &	EId,
		bool	outEdge,
		const TStr &	CrossName,
		const bool	sameMode,
		bool	isDir
	)

private

Definition at line 44 of file mmnet.cpp.

                                                                                                                              {
   if (!NeighborTypes.IsKey(CrossName)) {
     return -1;
   }
   TStr Name = GetNeighborCrossName(CrossName, outEdge, sameMode, isDir);
   return DelFromIntVAttrDatN(NId, EId, Name);
 }

int TModeNet::DelNeighbor	(	const int &	NId,
		const int &	EId,
		bool	outEdge,
		const TInt &	linkId,
		const bool	sameMode,
		bool	isDir
	)

private

Definition at line 52 of file mmnet.cpp.

                                                                                                                           {
   TStr CrossName = MMNet->GetCrossName(linkId);
   return DelNeighbor(NId, EId, outEdge, CrossName, sameMode, isDir);
 }

void TModeNet::DelNode ( const int & NId )

virtual

Deletes the given node from this mode.

Reimplemented from TNEANet.

Definition at line 57 of file mmnet.cpp.

                                      {
   TStrV Names;
   GetCrossNetNames(Names);
   for (int i=0; i < Names.Len(); i++) {
     TCrossNet& Cross = MMNet->GetCrossNetByName(Names[i]);
     TIntV OutEIds;
     GetNeighborsByCrossNet(NId, Names[i], OutEIds, true);
     for (int j=0; j < OutEIds.Len(); j++) {
       Cross.DelEdge(OutEIds[j].Val);
     }
     if (Cross.IsDirect && Cross.Mode1 == Cross.Mode2) {
       TIntV InEIds;
       GetNeighborsByCrossNet(NId, Names[i], InEIds, false);
       for (int j=0; j < InEIds.Len(); j++) {
         Cross.DelEdge(InEIds[j].Val);
       }
     }
   }
   TNEANet::DelNode(NId);
 }

TNodeI TModeNet::EndMMNI ( ) const

inline

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

Definition at line 78 of file mmnet.h.

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

THash::EndI

TIter EndI() const

Definition: hash.h:176

TNEANet::NodeH

THash< TInt, TNode > NodeH

Definition: network.h:1862

int TModeNet::GetAttrTypeN ( const TStr & attr ) const

private

Definition at line 159 of file mmnet.cpp.

                                                  {
   if (KeyToIndexTypeN.IsKey(attr)) {
     return KeyToIndexTypeN.GetDat(attr).Val1;
   }
   return -1;
 }

void TModeNet::GetCrossNetNames ( TStrV & Names ) const

inline

Gets a list of CrossNets that have this Mode as either a source or destination type.

Definition at line 71 of file mmnet.h.

71 { NeighborTypes.GetKeyV(Names); }

THash< TStr, TBool > NeighborTypes

Definition: mmnet.h:48

THash::GetKeyV

void GetKeyV(TVec< TKey > &KeyV) const

Definition: hash.h:442

TNodeI TModeNet::GetMMNI ( const int & NId ) const

inline

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

Definition at line 80 of file mmnet.h.

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

TNEANet::NodeH

THash< TInt, TNode > NodeH

Definition: network.h:1862

THash::GetI

TIter GetI(const TKey &Key) const

Definition: hash.h:178

TStr TModeNet::GetNeighborCrossName	(	const TStr &	CrossName,
		bool	isOutEdge,
		const bool	sameMode,
		bool	isDir
	)		const

private

Definition at line 4 of file mmnet.cpp.

                                                                                                                 {
   TStr Cpy(CrossName);
   if (!isDir || !sameMode) { return Cpy; }
   if (isOutEdge) {
     Cpy += ":SRC";
   } else {
     Cpy += ":DST";
   }
   return Cpy;
 }

void TModeNet::GetNeighborsByCrossNet	(	const int &	NId,
		TStr &	Name,
		TIntV &	Neighbors,
		const bool	isOutEId = `false`
	)		const

For the given node, gets all the neighbors for the crossnet type. If this mode is both the source and dest type, use isOutEId to specify direction.

Definition at line 106 of file mmnet.cpp.

                                                                                                             {
   //IAssertR(NeighborTypes.IsKey(Name), TStr::Fmt("Cross Type does not exist: %s", Name));
   TBool hasSingleVector = NeighborTypes.GetDat(Name);
   if (hasSingleVector) {
     Neighbors = GetIntVAttrDatN(NId, Name);
   } else {
     TStr DirectionalName = GetNeighborCrossName(Name, isOutEId, true, true);
     Neighbors = GetIntVAttrDatN(NId, DirectionalName);
   }
 }

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

inline

Definition at line 85 of file mmnet.h.

                                                { 
     if (this!=&Graph) {
       MxNId=Graph.MxNId; MxEId=Graph.MxEId; NodeH=Graph.NodeH; EdgeH=Graph.EdgeH;
       KeyToIndexTypeN=Graph.KeyToIndexTypeN; KeyToIndexTypeE=Graph.KeyToIndexTypeE;
       IntDefaultsN=Graph.IntDefaultsN; IntDefaultsE=Graph.IntDefaultsE; StrDefaultsN=Graph.StrDefaultsN; StrDefaultsE=Graph.StrDefaultsE;
       FltDefaultsN=Graph.FltDefaultsN; FltDefaultsE=Graph.FltDefaultsE; VecOfIntVecsN=Graph.VecOfIntVecsN; VecOfIntVecsE=Graph.VecOfIntVecsE;
       VecOfStrVecsN=Graph.VecOfStrVecsN; VecOfStrVecsE=Graph.VecOfStrVecsE; VecOfFltVecsN=Graph.VecOfFltVecsN; VecOfFltVecsE=Graph.VecOfFltVecsE;
       VecOfIntVecVecsN=Graph.VecOfIntVecVecsN; VecOfIntVecVecsE=Graph.VecOfIntVecVecsE; SAttrN=Graph.SAttrN; SAttrE=Graph.SAttrE;
       ModeId=Graph.ModeId; MMNet=Graph.MMNet; NeighborTypes=Graph.NeighborTypes;
     }
     return *this; 
   }

void TModeNet::RemoveCrossNets	(	TModeNet &	Result,
		TStrV &	CrossNets
	)

private

Definition at line 126 of file mmnet.cpp.

                                                                  {
   const TModeNet& self = *this;
   Result = TModeNet(self, false);
   for (TStrIntPrH::TIter it = KeyToIndexTypeN.BegI(); it < KeyToIndexTypeN.EndI(); it++) {
     TStr AttrName = it.GetKey();
     TInt AttrType = it.GetDat().GetVal1();
     TInt AttrIndex = it.GetDat().GetVal2();
     if (AttrType != IntVType) {
       Result.KeyToIndexTypeN.AddDat(AttrName, it.GetDat());
     } else {
       TStr WithoutSuffix = AttrName;
       bool removeSuffix = false;
       if (AttrName.IsSuffix(":SRC") || AttrName.IsSuffix(":DST")) {
         WithoutSuffix = AttrName.GetSubStr(0, AttrName.Len()-5);
         removeSuffix = true;
       }
       bool isSingleVNbrAttr = (NeighborTypes.IsKey(AttrName) && NeighborTypes.GetDat(AttrName));
       bool isMultiVNbrAttr = (removeSuffix && NeighborTypes.IsKey(WithoutSuffix) && !NeighborTypes.GetDat(WithoutSuffix));
       if (isSingleVNbrAttr || isMultiVNbrAttr) {
         TStr NbrName = isSingleVNbrAttr ? AttrName : WithoutSuffix;
         if (CrossNets.IsIn(NbrName)) {
           Result.AddNbrType(NbrName, removeSuffix, removeSuffix);
           TVec<TIntV>& Attrs = VecOfIntVecVecsN[AttrIndex];
           Result.AddIntVAttrByVecN(AttrName, Attrs);
         }
       } else {
         TVec<TIntV>& Attrs = VecOfIntVecVecsN[AttrIndex];
         Result.AddIntVAttrByVecN(AttrName, Attrs);
       }
     }
   }
 }

void TModeNet::Save ( TSOut & SOut ) const

inline

Saves the graph to a (binary) stream SOut.

Definition at line 65 of file mmnet.h.

65 {

66 TNEANet::Save(SOut); ModeId.Save(SOut); NeighborTypes.Save(SOut); }

TInt::Save

void Save(TSOut &SOut) const

Definition: dt.h:1060

THash::Save

void Save(TSOut &SOut) const

Definition: hash.h:141

TInt ModeId

Definition: mmnet.h:46