SNAP Library 2.4, Developer Reference  2015-05-11 19:40:56
SNAP, a general purpose, high performance system for analysis and manipulation of large networks
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Classes | Public Types | Public Member Functions | Static Public Member Functions | Protected Attributes | Private Member Functions | Friends | List of all members
TNodeEdgeNet< TNodeData, TEdgeData > Class Template Reference

Node Edge Network (directed multigraph, TNEGraph with data on nodes and edges). More...

#include <network.h>

Collaboration diagram for TNodeEdgeNet< TNodeData, TEdgeData >:
Collaboration graph
[legend]

Classes

class  TEdge
 
class  TEdgeI
 Edge iterator. Only forward iteration (operator++) is supported. More...
 
class  TNode
 
class  TNodeI
 Node iterator. Only forward iteration (operator++) is supported. More...
 

Public Types

typedef TNodeData TNodeDat
 
typedef TEdgeData TEdgeDat
 
typedef TNodeEdgeNet
< TNodeData, TEdgeData > 		TNet
 
typedef TPt< TNet > PNet
 

Public Member Functions

 TNodeEdgeNet ()
 
 TNodeEdgeNet (const int &Nodes, const int &Edges)
 Constructor that reserves enough memory for a network of Nodes nodes and Edges edges. More...
 
 TNodeEdgeNet (const TNodeEdgeNet &Net)
 
 TNodeEdgeNet (TSIn &SIn)
 Constructor that loads the network from a (binary) stream SIn. More...
 
virtual ~TNodeEdgeNet ()
 
virtual void Save (TSOut &SOut) const
 Saves the network to a (binary) stream SOut. More...
 
bool HasFlag (const TGraphFlag &Flag) const
 Allows for run-time checking the type of the network (see the TGraphFlag for flags). More...
 
TNodeEdgeNet & operator= (const TNodeEdgeNet &Net)
 
int GetNodes () const
 Returns the number of nodes in the network. More...
 
int AddNode (int NId=-1)
 Adds a node of ID NId to the network. More...
 
int AddNode (int NId, const TNodeData &NodeDat)
 Adds node data to node with ID NId. More...
 
int AddNode (const TNodeI &NodeI)
 Adds a node NodeI and its node data to the network. More...
 
void DelNode (const int &NId)
 Deletes node of ID NId from the network. More...
 
void DelNode (const TNode &NodeI)
 Deletes node of ID NodeI.GetId() from the network. More...
 
bool IsNode (const int &NId) const
 Tests whether ID NId is a node. More...
 
TNodeI BegNI () const
 Returns an iterator referring to the first node in the network. More...
 
TNodeI EndNI () const
 Returns an iterator referring to the past-the-end node in the network. More...
 
TNodeI GetNI (const int &NId) const
 Returns an iterator referring to the node of ID NId in the network. More...
 
void SetNDat (const int &NId, const TNodeData &NodeDat)
 Sets node data for the node of ID NId in the network. More...
 
TNodeData & GetNDat (const int &NId)
 Returns node data for the node of ID NId in the network. More...
 
const TNodeData & GetNDat (const int &NId) const
 Returns node data for the node of ID NId in the network. More...
 
int GetMxNId () const
 Returns an ID that is larger than any node ID in the network. More...
 
int GetEdges () const
 Returns the number of edges in the network. More...
 
int GetUniqEdges (const bool &IsDir=true) const
 Returns the number of edges in the network with a unique pair of nodes. More...
 
int AddEdge (const int &SrcNId, const int &DstNId, int EId=-1)
 Adds an edge between node IDs SrcNId and DstNId to the graph. More...
 
int AddEdge (const int &SrcNId, const int &DstNId, int EId, const TEdgeData &EdgeDat)
 Adds an edge and edge data from node IDs SrcNId to node DstNId. More...
 
int AddEdge (const TEdgeI &EdgeI)
 Adds an edge from EdgeI.GetSrcNId() to EdgeI.GetDstNId() and its edge data to the network. More...
 
void DelEdge (const int &EId)
 Deletes an edge with ID EId from the network. More...
 
void DelEdge (const int &SrcNId, const int &DstNId, const bool &IsDir=true)
 Deletes an edge from node IDs SrcNId to DstNId from the network. More...
 
bool IsEdge (const int &EId) const
 Tests whether an edge with ID EId exists in the network. More...
 
bool IsEdge (const int &SrcNId, const int &DstNId, const bool &IsDir=true) const
 Tests whether an edge from node IDs SrcNId to DstNId exists in the network. More...
 
bool IsEdge (const int &SrcNId, const int &DstNId, int &EId, const bool &IsDir=true) const
 Tests whether an edge from node IDs SrcNId to DstNId with edge ID EId exists in the network. More...
 
int GetEId (const int &SrcNId, const int &DstNId) const
 
TEdgeI BegEI () const
 Returns an iterator referring to the first edge in the network. More...
 
TEdgeI EndEI () const
 Returns an iterator referring to the past-the-end edge in the network. More...
 
TEdgeI GetEI (const int &EId) const
 Not supported/implemented! More...
 
TEdgeI GetEI (const int &SrcNId, const int &DstNId) const
 Returns an iterator referring to edge (SrcNId, DstNId) in the graph. More...
 
void SetEDat (const int &EId, const TEdgeData &EdgeDat)
 Sets edge data for the edge of ID NId in the network. More...
 
TEdgeData & GetEDat (const int &EId)
 Returns edge data for the edge with ID EId. More...
 
const TEdgeData & GetEDat (const int &EId) const
 Returns edge data for the edge with ID EId. More...
 
void SetAllEDat (const TEdgeData &EdgeDat)
 Sets edge data for all the edges in the network to EDat. More...
 
int GetRndNId (TRnd &Rnd=TInt::Rnd)
 Returns an ID of a random node in the network. More...
 
TNodeI GetRndNI (TRnd &Rnd=TInt::Rnd)
 Returns an interator referring to a random node in the network. More...
 
int GetRndEId (TRnd &Rnd=TInt::Rnd)
 Returns an ID of a random edge in the network. More...
 
TEdgeI GetRndEI (TRnd &Rnd=TInt::Rnd)
 Returns an interator referring to a random edge in the network. More...
 
void GetNIdV (TIntV &NIdV) const
 Returns a vector of all node IDs in the network. More...
 
void GetEIdV (TIntV &EIdV) const
 Returns a vector of all edge IDs in the network. More...
 
bool Empty () const
 Tests whether the network is empty (has zero nodes). More...
 
void Clr ()
 Deletes all nodes and edges from the network. More...
 
void Reserve (const int &Nodes, const int &Edges)
 Reserves memory for a network of Nodes nodes and Edges edges. More...
 
void SortNIdById (const bool &Asc=true)
 Sorts nodes by node IDs. More...
 
void SortNIdByDat (const bool &Asc=true)
 Sorts nodes by node data. More...
 
void SortEIdById (const bool &Asc=true)
 Sorts edges by edge IDs. More...
 
void SortEIdByDat (const bool &Asc=true)
 Sorts edges by edge data. More...
 
void Defrag (const bool &OnlyNodeLinks=false)
 Defragments the network. More...
 
bool IsOk (const bool &ThrowExcept=true) const
 Checks the network data structure for internal consistency. More...
 

Static Public Member Functions

static PNet New ()
 Static constructor that returns a pointer to the network. Call: TPt <TNodeEdgeNet<TNodeData, TEdgeData> > Net = TNodeEdgeNet<TNodeData, TEdgeData>::New(). More...
 
static PNet Load (TSIn &SIn)
 Static constructor that loads the network from a stream SIn and returns a pointer to it. More...
 

Protected Attributes

TCRef CRef
 
TInt MxNId
 
TInt MxEId
 
THash< TInt, TNode > NodeH
 
THash< TInt, TEdge > EdgeH
 

Private Member Functions

TNode & GetNode (const int &NId)
 
const TNode & GetNode (const int &NId) const
 
const TNode & GetNodeKId (const int &NodeKeyId) const
 
TEdge & GetEdge (const int &EId)
 
const TEdge & GetEdge (const int &EId) const
 
const TEdge & GetEdgeKId (const int &EdgeKeyId) const
 

Friends

class TPt< TNodeEdgeNet< TNodeData, TEdgeData > >
 

Detailed Description

template<class TNodeData, class TEdgeData>
class TNodeEdgeNet< TNodeData, TEdgeData >

Node Edge Network (directed multigraph, TNEGraph with data on nodes and edges).

Definition at line 978 of file network.h.

Member Typedef Documentation

template<class TNodeData, class TEdgeData>
typedef TPt<TNet> TNodeEdgeNet< TNodeData, TEdgeData >::PNet

Definition at line 983 of file network.h.

template<class TNodeData, class TEdgeData>
typedef TEdgeData TNodeEdgeNet< TNodeData, TEdgeData >::TEdgeDat

Definition at line 981 of file network.h.

template<class TNodeData, class TEdgeData>
typedef TNodeEdgeNet<TNodeData, TEdgeData> TNodeEdgeNet< TNodeData, TEdgeData >::TNet

Definition at line 982 of file network.h.

template<class TNodeData, class TEdgeData>
typedef TNodeData TNodeEdgeNet< TNodeData, TEdgeData >::TNodeDat

Definition at line 980 of file network.h.

Constructor & Destructor Documentation

template<class TNodeData, class TEdgeData>
TNodeEdgeNet< TNodeData, TEdgeData >::TNodeEdgeNet ( )
inline

Definition at line 1153 of file network.h.

1153 : CRef(), MxNId(0), MxEId(0) { }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TNodeEdgeNet::CRef
TCRef CRef
Definition: network.h:1148
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
template<class TNodeData, class TEdgeData>
TNodeEdgeNet< TNodeData, TEdgeData >::TNodeEdgeNet ( const int &  Nodes,
const int &  Edges 
)
inlineexplicit

Constructor that reserves enough memory for a network of Nodes nodes and Edges edges.

Definition at line 1155 of file network.h.

1155 : CRef(), MxNId(0), MxEId(0) { Reserve(Nodes, Edges); }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TNodeEdgeNet::Reserve
void Reserve(const int &Nodes, const int &Edges)
Reserves memory for a network of Nodes nodes and Edges edges.
Definition: network.h:1281
TNodeEdgeNet::CRef
TCRef CRef
Definition: network.h:1148
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
template<class TNodeData, class TEdgeData>
TNodeEdgeNet< TNodeData, TEdgeData >::TNodeEdgeNet ( const TNodeEdgeNet< TNodeData, TEdgeData > &  Net)
inline

Definition at line 1156 of file network.h.

1156 : MxNId(Net.MxNId), MxEId(Net.MxEId), NodeH(Net.NodeH), EdgeH(Net.EdgeH) { }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData, class TEdgeData>
TNodeEdgeNet< TNodeData, TEdgeData >::TNodeEdgeNet ( TSIn &  SIn)
inline

Constructor that loads the network from a (binary) stream SIn.

Definition at line 1158 of file network.h.

1158 : MxNId(SIn), MxEId(SIn), NodeH(SIn), EdgeH(SIn) { }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData, class TEdgeData>
virtual TNodeEdgeNet< TNodeData, TEdgeData >::~TNodeEdgeNet ( )
inlinevirtual

Definition at line 1159 of file network.h.

1159 { }

Member Function Documentation

template<class TNodeData , class TEdgeData >
int TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge ( const int &  SrcNId,
const int &  DstNId,
int  EId = -1 
)

Adds an edge between node IDs SrcNId and DstNId to the graph.

Returns the ID of the edge being added. If EId is -1, edge ID is automatically assigned. Aborts, if an edge with ID EId already exists. Aborts, if SrcNId or DstNId are not nodes in the graph.

Definition at line 1403 of file network.h.

References THash< TKey, TDat, THashFunc >::AddDat(), TVec< TVal, TSizeTy >::AddSorted(), TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, TStr::Fmt(), TNodeEdgeNet< TNodeData, TEdgeData >::GetNode(), IAssertR, TNodeEdgeNet< TNodeData, TEdgeData >::TNode::InEIdV, TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::IsNode(), TMath::Mx(), TNodeEdgeNet< TNodeData, TEdgeData >::MxEId, and TNodeEdgeNet< TNodeData, TEdgeData >::TNode::OutEIdV.

Referenced by TTimeNENet::GetESubGraph(), TTimeNENet::GetGraphUpToTm(), and TTimeNENet::GetSubGraph().

1403  {
1404  if (EId == -1) { EId = MxEId; MxEId++; }
1405  else { MxEId = TMath::Mx(EId+1, MxEId()); }
1406  IAssertR(!IsEdge(EId), TStr::Fmt("EdgeId %d already exists", EId));
1407  IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
1408  EdgeH.AddDat(EId, TEdge(EId, SrcNId, DstNId));
1409  GetNode(SrcNId).OutEIdV.AddSorted(EId);
1410  GetNode(DstNId).InEIdV.AddSorted(EId);
1411  return EId;
1412 }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
IAssertR
#define IAssertR(Cond, Reason)
Definition: bd.h:265
TMath::Mx
static const T & Mx(const T &LVal, const T &RVal)
Definition: xmath.h:32
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
TVec::AddSorted
TSizeTy AddSorted(const TVal &Val, const bool &Asc=true, const TSizeTy &_MxVals=-1)
Adds element Val to a sorted vector.
Definition: ds.h:1027
TNodeEdgeNet::GetNode
TNode & GetNode(const int &NId)
Definition: network.h:1141
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599
THash::AddDat
TDat & AddDat(const TKey &Key)
Definition: hash.h:196

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge ( const int &  SrcNId,
const int &  DstNId,
int  EId,
const TEdgeData &  EdgeDat 
)

Adds an edge and edge data from node IDs SrcNId to node DstNId.

Returns the ID of the edge being added. If EId is -1, edge ID is automatically assigned. Aborts, if an edge with ID EId already exists. Aborts, if SrcNId or DstNId are not nodes in the graph.

Definition at line 1415 of file network.h.

References THash< TKey, TDat, THashFunc >::AddDat(), TVec< TVal, TSizeTy >::AddSorted(), TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, TStr::Fmt(), TNodeEdgeNet< TNodeData, TEdgeData >::GetNode(), IAssertR, TNodeEdgeNet< TNodeData, TEdgeData >::TNode::InEIdV, TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::IsNode(), TMath::Mx(), TNodeEdgeNet< TNodeData, TEdgeData >::MxEId, and TNodeEdgeNet< TNodeData, TEdgeData >::TNode::OutEIdV.

1415  {
1416  if (EId == -1) { EId = MxEId; MxEId++; }
1417  else { MxEId = TMath::Mx(EId+1, MxEId()); }
1418  IAssertR(!IsEdge(EId), TStr::Fmt("EdgeId %d already exists", EId));
1419  IAssertR(IsNode(SrcNId) && IsNode(DstNId), TStr::Fmt("%d or %d not a node.", SrcNId, DstNId).CStr());
1420  EdgeH.AddDat(EId, TEdge(EId, SrcNId, DstNId, EdgeDat));
1421  GetNode(SrcNId).OutEIdV.AddSorted(EId);
1422  GetNode(DstNId).InEIdV.AddSorted(EId);
1423  return EId;
1424 }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
IAssertR
#define IAssertR(Cond, Reason)
Definition: bd.h:265
TMath::Mx
static const T & Mx(const T &LVal, const T &RVal)
Definition: xmath.h:32
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
TVec::AddSorted
TSizeTy AddSorted(const TVal &Val, const bool &Asc=true, const TSizeTy &_MxVals=-1)
Adds element Val to a sorted vector.
Definition: ds.h:1027
TNodeEdgeNet::GetNode
TNode & GetNode(const int &NId)
Definition: network.h:1141
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599
THash::AddDat
TDat & AddDat(const TKey &Key)
Definition: hash.h:196

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge ( const TEdgeI &  EdgeI)
inline

Adds an edge from EdgeI.GetSrcNId() to EdgeI.GetDstNId() and its edge data to the network.

Definition at line 1230 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::AddEdge().

1230 { return AddEdge(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), EdgeI.GetId(), EdgeI.GetDat()); }
TNodeEdgeNet::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId, int EId=-1)
Adds an edge between node IDs SrcNId and DstNId to the graph.
Definition: network.h:1403

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
int TNodeEdgeNet< TNodeData, TEdgeData >::AddNode ( int  NId = -1)

Adds a node of ID NId to the network.

Returns the ID of the node being added. If NId is -1, node ID is automatically assigned. Aborts, if a node with ID NId already exists.

Definition at line 1341 of file network.h.

References THash< TKey, TDat, THashFunc >::AddDat(), TStr::Fmt(), IAssertR, TNodeEdgeNet< TNodeData, TEdgeData >::IsNode(), TMath::Mx(), TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

Referenced by TTimeNENet::GetESubGraph(), TTimeNENet::GetGraphUpToTm(), and TTimeNENet::GetSubGraph().

1341  {
1342  if (NId == -1) {
1343  NId = MxNId; MxNId++;
1344  } else {
1345  IAssertR(!IsNode(NId), TStr::Fmt("NodeId %d already exists", NId));
1346  MxNId = TMath::Mx(NId+1, MxNId());
1347  }
1348  NodeH.AddDat(NId, TNode(NId));
1349  return NId;
1350 }
IAssertR
#define IAssertR(Cond, Reason)
Definition: bd.h:265
TMath::Mx
static const T & Mx(const T &LVal, const T &RVal)
Definition: xmath.h:32
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599
THash::AddDat
TDat & AddDat(const TKey &Key)
Definition: hash.h:196

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData >
int TNodeEdgeNet< TNodeData, TEdgeData >::AddNode ( int  NId,
const TNodeData &  NodeDat 
)

Adds node data to node with ID NId.

Returns the ID of the node being added. If NId is -1, node ID is automatically assigned. Aborts, if a node with ID NId already exists.

Definition at line 1353 of file network.h.

References THash< TKey, TDat, THashFunc >::AddDat(), TStr::Fmt(), IAssertR, TNodeEdgeNet< TNodeData, TEdgeData >::IsNode(), TMath::Mx(), TNodeEdgeNet< TNodeData, TEdgeData >::MxNId, and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

1353  {
1354  if (NId == -1) {
1355  NId = MxNId; MxNId++;
1356  } else {
1357  IAssertR(!IsNode(NId), TStr::Fmt("NodeId %d already exists", NId));
1358  MxNId = TMath::Mx(NId+1, MxNId());
1359  }
1360  NodeH.AddDat(NId, TNode(NId, NodeDat));
1361  return NId;
1362 }
IAssertR
#define IAssertR(Cond, Reason)
Definition: bd.h:265
TMath::Mx
static const T & Mx(const T &LVal, const T &RVal)
Definition: xmath.h:32
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599
THash::AddDat
TDat & AddDat(const TKey &Key)
Definition: hash.h:196

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::AddNode ( const TNodeI &  NodeI)
inline

Adds a node NodeI and its node data to the network.

Definition at line 1186 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::AddNode().

1186 { return AddNode(NodeI.GetId(), NodeI.GetDat()); }
TNodeEdgeNet::AddNode
int AddNode(int NId=-1)
Adds a node of ID NId to the network.
Definition: network.h:1341

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TEdgeI TNodeEdgeNet< TNodeData, TEdgeData >::BegEI ( ) const
inline

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

Definition at line 1247 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::GetUniqEdges(), and TNodeEdgeNet< TNodeData, TEdgeData >::SetAllEDat().

1247 { return TEdgeI(EdgeH.BegI(), this); }
THash::BegI
TIter BegI() const
Definition: hash.h:171
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TNodeI TNodeEdgeNet< TNodeData, TEdgeData >::BegNI ( ) const
inline

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

Definition at line 1196 of file network.h.

1196 { return TNodeI(NodeH.BegI(), this); }
THash::BegI
TIter BegI() const
Definition: hash.h:171
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::Clr ( )
inline

Deletes all nodes and edges from the network.

Definition at line 1279 of file network.h.

1279 { MxNId=0; MxEId=0; NodeH.Clr(); EdgeH.Clr(); }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::Clr
void Clr(const bool &DoDel=true, const int &NoDelLim=-1, const bool &ResetDat=true)
Definition: hash.h:315
template<class TNodeData , class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::Defrag ( const bool &  OnlyNodeLinks = false)

Defragments the network.

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

Definition at line 1496 of file network.h.

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

Referenced by TTimeNENet::GetESubGraph(), TTimeNENet::GetGraphUpToTm(), and TTimeNENet::GetSubGraph().

1496  {
1497  for (int kid = NodeH.FFirstKeyId(); NodeH.FNextKeyId(kid);) {
1498  TNode& Node = NodeH[kid];
1499  Node.InEIdV.Pack(); Node.OutEIdV.Pack();
1500  }
1501  if (! OnlyNodeLinks && ! NodeH.IsKeyIdEqKeyN()) { NodeH.Defrag(); }
1502  if (! OnlyNodeLinks && ! EdgeH.IsKeyIdEqKeyN()) { EdgeH.Defrag(); }
1503 }
THash::IsKeyIdEqKeyN
bool IsKeyIdEqKeyN() const
Definition: hash.h:191
THash::Defrag
void Defrag()
Definition: hash.h:509
THash::FNextKeyId
bool FNextKeyId(int &KeyId) const
Definition: hash.h:432
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::FFirstKeyId
int FFirstKeyId() const
Definition: hash.h:232
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::Pack
void Pack()
Definition: hash.h:243

Here is the call graph for this function:

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::DelEdge ( const int &  EId)

Deletes an edge with ID EId from the network.

Definition at line 1427 of file network.h.

References TVec< TVal, TSizeTy >::DelIfIn(), THash< TKey, TDat, THashFunc >::DelKey(), TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetDstNId(), TNodeEdgeNet< TNodeData, TEdgeData >::GetEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::GetNode(), TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetSrcNId(), IAssert, TNodeEdgeNet< TNodeData, TEdgeData >::TNode::InEIdV, TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge(), and TNodeEdgeNet< TNodeData, TEdgeData >::TNode::OutEIdV.

1427  {
1428  IAssert(IsEdge(EId));
1429  const int SrcNId = GetEdge(EId).GetSrcNId();
1430  const int DstNId = GetEdge(EId).GetDstNId();
1431  GetNode(SrcNId).OutEIdV.DelIfIn(EId);
1432  GetNode(DstNId).InEIdV.DelIfIn(EId);
1433  EdgeH.DelKey(EId);
1434 }
IAssert
#define IAssert(Cond)
Definition: bd.h:262
TVec::DelIfIn
bool DelIfIn(const TVal &Val)
Removes the first occurrence of element Val.
Definition: ds.h:1115
THash::DelKey
void DelKey(const TKey &Key)
Definition: hash.h:358
TNodeEdgeNet::GetNode
TNode & GetNode(const int &NId)
Definition: network.h:1141
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240
TNodeEdgeNet::TEdge::GetDstNId
int GetDstNId() const
Definition: network.h:1027
TNodeEdgeNet::TEdge::GetSrcNId
int GetSrcNId() const
Definition: network.h:1026
TNodeEdgeNet::GetEdge
TEdge & GetEdge(const int &EId)
Definition: network.h:1144

Here is the call graph for this function:

template<class TNodeData , class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::DelEdge ( const int &  SrcNId,
const int &  DstNId,
const bool &  IsDir = true 
)

Deletes an edge from node IDs SrcNId to DstNId from the network.

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

Definition at line 1437 of file network.h.

References TVec< TVal, TSizeTy >::DelIfIn(), THash< TKey, TDat, THashFunc >::DelKey(), TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, TNodeEdgeNet< TNodeData, TEdgeData >::GetNode(), IAssert, TNodeEdgeNet< TNodeData, TEdgeData >::TNode::InEIdV, TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge(), and TNodeEdgeNet< TNodeData, TEdgeData >::TNode::OutEIdV.

1437  {
1438  int EId;
1439  IAssert(IsEdge(SrcNId, DstNId, EId, IsDir));
1440  GetNode(SrcNId).OutEIdV.DelIfIn(EId);
1441  GetNode(DstNId).InEIdV.DelIfIn(EId);
1442  EdgeH.DelKey(EId);
1443 }
IAssert
#define IAssert(Cond)
Definition: bd.h:262
TVec::DelIfIn
bool DelIfIn(const TVal &Val)
Removes the first occurrence of element Val.
Definition: ds.h:1115
THash::DelKey
void DelKey(const TKey &Key)
Definition: hash.h:358
TNodeEdgeNet::GetNode
TNode & GetNode(const int &NId)
Definition: network.h:1141
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240

Here is the call graph for this function:

template<class TNodeData , class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::DelNode ( const int &  NId)

Deletes node of ID NId from the network.

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

Definition at line 1365 of file network.h.

References THash< TKey, TDat, THashFunc >::DelKey(), TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH, TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetDstNId(), TNodeEdgeNet< TNodeData, TEdgeData >::GetEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetInDeg(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetInEId(), TNodeEdgeNet< TNodeData, TEdgeData >::GetNode(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetOutDeg(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetOutEId(), TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetSrcNId(), IAssert, and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

1365  {
1366  const TNode& Node = GetNode(NId);
1367  for (int out = 0; out < Node.GetOutDeg(); out++) {
1368  const int EId = Node.GetOutEId(out);
1369  const TEdge& Edge = GetEdge(EId);
1370  IAssert(Edge.GetSrcNId() == NId);
1371  GetNode(Edge.GetDstNId()).InEIdV.DelIfIn(EId);
1372  EdgeH.DelKey(EId);
1373  }
1374  for (int in = 0; in < Node.GetInDeg(); in++) {
1375  const int EId = Node.GetInEId(in);
1376  const TEdge& Edge = GetEdge(EId);
1377  IAssert(Edge.GetDstNId() == NId);
1378  GetNode(Edge.GetSrcNId()).OutEIdV.DelIfIn(EId);
1379  EdgeH.DelKey(EId);
1380  }
1381  NodeH.DelKey(NId);
1382 }
IAssert
#define IAssert(Cond)
Definition: bd.h:262
THash::DelKey
void DelKey(const TKey &Key)
Definition: hash.h:358
TNodeEdgeNet::GetNode
TNode & GetNode(const int &NId)
Definition: network.h:1141
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::GetEdge
TEdge & GetEdge(const int &EId)
Definition: network.h:1144

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::DelNode ( const TNode &  NodeI)
inline

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

Definition at line 1192 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::DelNode().

1192 { DelNode(NodeI.GetId()); }
TNodeEdgeNet::DelNode
void DelNode(const int &NId)
Deletes node of ID NId from the network.
Definition: network.h:1365

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
bool TNodeEdgeNet< TNodeData, TEdgeData >::Empty ( ) const
inline

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

Definition at line 1277 of file network.h.

1277 { return GetNodes()==0; }
TNodeEdgeNet::GetNodes
int GetNodes() const
Returns the number of nodes in the network.
Definition: network.h:1172
template<class TNodeData, class TEdgeData>
TEdgeI TNodeEdgeNet< TNodeData, TEdgeData >::EndEI ( ) const
inline

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

Definition at line 1249 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::GetUniqEdges(), and TNodeEdgeNet< TNodeData, TEdgeData >::SetAllEDat().

1249 { return TEdgeI(EdgeH.EndI(), this); }
THash::EndI
TIter EndI() const
Definition: hash.h:176
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TNodeI TNodeEdgeNet< TNodeData, TEdgeData >::EndNI ( ) const
inline

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

Definition at line 1198 of file network.h.

1198 { return TNodeI(NodeH.EndI(), this); }
THash::EndI
TIter EndI() const
Definition: hash.h:176
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
template<class TNodeData, class TEdgeData>
TEdgeData& TNodeEdgeNet< TNodeData, TEdgeData >::GetEDat ( const int &  EId)
inline

Returns edge data for the edge with ID EId.

Definition at line 1257 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetInEDat(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetNbrEDat(), and TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetOutEDat().

1257 { return EdgeH.GetDat(EId).EdgeDat; }
TNodeEdgeNet::TEdge::EdgeDat
TEdgeData EdgeDat
Definition: network.h:1016
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
const TEdgeData& TNodeEdgeNet< TNodeData, TEdgeData >::GetEDat ( const int &  EId) const
inline

Returns edge data for the edge with ID EId.

Definition at line 1259 of file network.h.

1259 { return EdgeH.GetDat(EId).EdgeDat; }
TNodeEdgeNet::TEdge::EdgeDat
TEdgeData EdgeDat
Definition: network.h:1016
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData, class TEdgeData>
TEdge& TNodeEdgeNet< TNodeData, TEdgeData >::GetEdge ( const int &  EId)
inlineprivate

Definition at line 1144 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::DelEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::DelNode(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetInNId(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetNbrNId(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetOutNId(), TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge(), and TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::IsInNId().

1144 { return EdgeH.GetDat(EId); }
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
const TEdge& TNodeEdgeNet< TNodeData, TEdgeData >::GetEdge ( const int &  EId) const
inlineprivate

Definition at line 1145 of file network.h.

1145 { return EdgeH.GetDat(EId); }
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData, class TEdgeData>
const TEdge& TNodeEdgeNet< TNodeData, TEdgeData >::GetEdgeKId ( const int &  EdgeKeyId) const
inlineprivate

Definition at line 1146 of file network.h.

1146 { return EdgeH[EdgeKeyId]; }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::GetEdges ( ) const
inline

Returns the number of edges in the network.

Definition at line 1212 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::GetEIdV(), and TNodeEdgeNet< TNodeData, TEdgeData >::GetUniqEdges().

1212 { return EdgeH.Len(); }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::Len
int Len() const
Definition: hash.h:186

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TEdgeI TNodeEdgeNet< TNodeData, TEdgeData >::GetEI ( const int &  EId) const
inline

Not supported/implemented!

Definition at line 1251 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::GetRndEI(), TNEANet::GetRndEI(), and TNodeEdgeNet< TNodeData, TEdgeData >::SetEDat().

1251 { return TEdgeI(EdgeH.GetI(EId), this); }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::GetI
TIter GetI(const TKey &Key) const
Definition: hash.h:178

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TEdgeI TNodeEdgeNet< TNodeData, TEdgeData >::GetEI ( const int &  SrcNId,
const int &  DstNId 
) const
inline

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

Definition at line 1253 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::GetEI().

1253 { return GetEI(GetEId(SrcNId, DstNId)); }
TNodeEdgeNet::GetEI
TEdgeI GetEI(const int &EId) const
Not supported/implemented!
Definition: network.h:1251
TNodeEdgeNet::GetEId
int GetEId(const int &SrcNId, const int &DstNId) const
Definition: network.h:1245

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::GetEId ( const int &  SrcNId,
const int &  DstNId 
) const
inline

Definition at line 1245 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::GetEI(), and TNEANet::GetEI().

1245 { int EId; return IsEdge(SrcNId, DstNId, EId)?EId:-1; }
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::GetEIdV ( TIntV &  EIdV) const

Returns a vector of all edge IDs in the network.

Definition at line 1488 of file network.h.

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

1488  {
1489  EIdV.Gen(GetEdges(), 0);
1490  for (int E=EdgeH.FFirstKeyId(); EdgeH.FNextKeyId(E);) {
1491  EIdV.Add(EdgeH.GetKey(E));
1492  }
1493 }
THash::FNextKeyId
bool FNextKeyId(int &KeyId) const
Definition: hash.h:432
THash::FFirstKeyId
int FFirstKeyId() const
Definition: hash.h:232
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::GetEdges
int GetEdges() const
Returns the number of edges in the network.
Definition: network.h:1212
TVec::Gen
void Gen(const TSizeTy &_Vals)
Constructs a vector (an array) of _Vals elements.
Definition: ds.h:486
TVec::Add
TSizeTy Add()
Adds a new element at the end of the vector, after its current last element.
Definition: ds.h:559
THash::GetKey
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::GetMxNId ( ) const
inline

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

Definition at line 1208 of file network.h.

1208 { return MxNId; }
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
template<class TNodeData, class TEdgeData>
TNodeData& TNodeEdgeNet< TNodeData, TEdgeData >::GetNDat ( const int &  NId)
inline

Returns node data for the node of ID NId in the network.

Definition at line 1204 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::TEdgeI::GetDstNDat(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetInNDat(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetNbrNDat(), TNodeEdgeNet< TNodeData, TEdgeData >::TNodeI::GetOutNDat(), and TNodeEdgeNet< TNodeData, TEdgeData >::TEdgeI::GetSrcNDat().

1204 { return NodeH.GetDat(NId).NodeDat; }
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::TNode::NodeDat
TNodeData NodeDat
Definition: network.h:989
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
const TNodeData& TNodeEdgeNet< TNodeData, TEdgeData >::GetNDat ( const int &  NId) const
inline

Returns node data for the node of ID NId in the network.

Definition at line 1206 of file network.h.

1206 { return NodeH.GetDat(NId).NodeDat; }
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::TNode::NodeDat
TNodeData NodeDat
Definition: network.h:989
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
template<class TNodeData, class TEdgeData>
TNodeI TNodeEdgeNet< TNodeData, TEdgeData >::GetNI ( const int &  NId) const
inline

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

Definition at line 1200 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::GetRndNI(), and TNEANet::GetRndNI().

1200 { return TNodeI(NodeH.GetI(NId), this); }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::GetI
TIter GetI(const TKey &Key) const
Definition: hash.h:178

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::GetNIdV ( TIntV &  NIdV) const

Returns a vector of all node IDs in the network.

Definition at line 1480 of file network.h.

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

1480  {
1481  NIdV.Gen(GetNodes(), 0);
1482  for (int N=NodeH.FFirstKeyId(); NodeH.FNextKeyId(N);) {
1483  NIdV.Add(NodeH.GetKey(N));
1484  }
1485 }
TNodeEdgeNet::GetNodes
int GetNodes() const
Returns the number of nodes in the network.
Definition: network.h:1172
THash::FNextKeyId
bool FNextKeyId(int &KeyId) const
Definition: hash.h:432
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::FFirstKeyId
int FFirstKeyId() const
Definition: hash.h:232
TVec::Gen
void Gen(const TSizeTy &_Vals)
Constructs a vector (an array) of _Vals elements.
Definition: ds.h:486
TVec::Add
TSizeTy Add()
Adds a new element at the end of the vector, after its current last element.
Definition: ds.h:559
THash::GetKey
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
TNode& TNodeEdgeNet< TNodeData, TEdgeData >::GetNode ( const int &  NId)
inlineprivate

Definition at line 1141 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::DelEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::DelNode(), and TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge().

1141 { return NodeH.GetDat(NId); }
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
const TNode& TNodeEdgeNet< TNodeData, TEdgeData >::GetNode ( const int &  NId) const
inlineprivate

Definition at line 1142 of file network.h.

1142 { return NodeH.GetDat(NId); }
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
template<class TNodeData, class TEdgeData>
const TNode& TNodeEdgeNet< TNodeData, TEdgeData >::GetNodeKId ( const int &  NodeKeyId) const
inlineprivate

Definition at line 1143 of file network.h.

1143 { return NodeH[NodeKeyId]; }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::GetNodes ( ) const
inline

Returns the number of nodes in the network.

Definition at line 1172 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::Empty(), TNEANet::Empty(), and TNodeEdgeNet< TNodeData, TEdgeData >::GetNIdV().

1172 { return NodeH.Len(); }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::Len
int Len() const
Definition: hash.h:186

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TEdgeI TNodeEdgeNet< TNodeData, TEdgeData >::GetRndEI ( TRnd &  Rnd = TInt::Rnd)
inline

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

Definition at line 1270 of file network.h.

1270 { return GetEI(GetRndEId(Rnd)); }
TNodeEdgeNet::GetEI
TEdgeI GetEI(const int &EId) const
Not supported/implemented!
Definition: network.h:1251
TNodeEdgeNet::GetRndEId
int GetRndEId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random edge in the network.
Definition: network.h:1268
template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::GetRndEId ( TRnd &  Rnd = TInt::Rnd)
inline

Returns an ID of a random edge in the network.

Definition at line 1268 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::GetRndEI(), and TNEANet::GetRndEI().

1268 { return EdgeH.GetKey(EdgeH.GetRndKeyId(Rnd, 0.8)); }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::GetRndKeyId
int GetRndKeyId(TRnd &Rnd) const
Get an index of a random element. If the hash table has many deleted keys, this may take a long time...
Definition: hash.h:398
THash::GetKey
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
TNodeI TNodeEdgeNet< TNodeData, TEdgeData >::GetRndNI ( TRnd &  Rnd = TInt::Rnd)
inline

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

Definition at line 1266 of file network.h.

1266 { return GetNI(GetRndNId(Rnd)); }
TNodeEdgeNet::GetRndNId
int GetRndNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random node in the network.
Definition: network.h:1264
TNodeEdgeNet::GetNI
TNodeI GetNI(const int &NId) const
Returns an iterator referring to the node of ID NId in the network.
Definition: network.h:1200
template<class TNodeData, class TEdgeData>
int TNodeEdgeNet< TNodeData, TEdgeData >::GetRndNId ( TRnd &  Rnd = TInt::Rnd)
inline

Returns an ID of a random node in the network.

Definition at line 1264 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::GetRndNI(), and TNEANet::GetRndNI().

1264 { return NodeH.GetKey(NodeH.GetRndKeyId(Rnd, 0.8)); }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::GetRndKeyId
int GetRndKeyId(TRnd &Rnd) const
Get an index of a random element. If the hash table has many deleted keys, this may take a long time...
Definition: hash.h:398
THash::GetKey
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
int TNodeEdgeNet< TNodeData, TEdgeData >::GetUniqEdges ( const bool &  IsDir = true) const

Returns the number of edges in the network with a unique pair of nodes.

Definition at line 1391 of file network.h.

References THashSet< TKey, THashFunc >::AddKey(), TNodeEdgeNet< TNodeData, TEdgeData >::BegEI(), TNodeEdgeNet< TNodeData, TEdgeData >::EndEI(), TNodeEdgeNet< TNodeData, TEdgeData >::GetEdges(), THashSet< TKey, THashFunc >::Len(), TMath::Mn(), and TMath::Mx().

1391  {
1392  TIntPrSet UniqESet(GetEdges());
1393  for (TEdgeI EI = BegEI(); EI < EndEI(); EI++) {
1394  const int Src = EI.GetSrcNId();
1395  const int Dst = EI.GetDstNId();
1396  if (IsDir) { UniqESet.AddKey(TIntPr(Src, Dst)); }
1397  else { UniqESet.AddKey(TIntPr(TMath::Mn(Src, Dst), TMath::Mx(Src, Dst))); }
1398  }
1399  return UniqESet.Len();
1400 }
TMath::Mn
static const T & Mn(const T &LVal, const T &RVal)
Definition: xmath.h:36
TIntPr
TPair< TInt, TInt > TIntPr
Definition: ds.h:83
TNodeEdgeNet::BegEI
TEdgeI BegEI() const
Returns an iterator referring to the first edge in the network.
Definition: network.h:1247
TMath::Mx
static const T & Mx(const T &LVal, const T &RVal)
Definition: xmath.h:32
TNodeEdgeNet::GetEdges
int GetEdges() const
Returns the number of edges in the network.
Definition: network.h:1212
TNodeEdgeNet::EndEI
TEdgeI EndEI() const
Returns an iterator referring to the past-the-end edge in the network.
Definition: network.h:1249

Here is the call graph for this function:

template<class TNodeData , class TEdgeData >
bool TNodeEdgeNet< TNodeData, TEdgeData >::HasFlag ( const TGraphFlag &  Flag) const

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

Definition at line 1316 of file network.h.

References HasGraphFlag.

1316  {
1317  return HasGraphFlag(typename TNet, Flag);
1318 }
HasGraphFlag
#define HasGraphFlag(TGraph, Flag)
For quick testing of the properties of the graph/network object (see TGraphFlag). ...
Definition: gbase.h:38
TNodeEdgeNet::TNet
TNodeEdgeNet< TNodeData, TEdgeData > TNet
Definition: network.h:982
template<class TNodeData, class TEdgeData>
bool TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge ( const int &  EId) const
inline

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

Definition at line 1240 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::DelEdge(), TNodeEdgeNet< TSecTm, TSecTm >::GetEId(), TNEANet::GetEId(), TNodeEdgeNet< TNodeData, TEdgeData >::IsOk(), and TNodeEdgeNet< TNodeData, TEdgeData >::SetEDat().

1240 { return EdgeH.IsKey(EId); }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::IsKey
bool IsKey(const TKey &Key) const
Definition: hash.h:216

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
bool TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge ( const int &  SrcNId,
const int &  DstNId,
const bool &  IsDir = true 
) const
inline

Tests whether an edge from node IDs SrcNId to DstNId exists in the network.

Definition at line 1242 of file network.h.

Referenced by TNodeEdgeNet< TSecTm, TSecTm >::IsEdge().

1242 { int EId; return IsEdge(SrcNId, DstNId, EId, IsDir); }
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
bool TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge ( const int &  SrcNId,
const int &  DstNId,
int &  EId,
const bool &  IsDir = true 
) const

Tests whether an edge from node IDs SrcNId to DstNId with edge ID EId exists in the network.

Definition at line 1446 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetDstNId(), TNodeEdgeNet< TNodeData, TEdgeData >::GetEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetId(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetInDeg(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetInEId(), TNodeEdgeNet< TNodeData, TEdgeData >::GetNode(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetOutDeg(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::GetOutEId(), TNodeEdgeNet< TNodeData, TEdgeData >::TEdge::GetSrcNId(), and TNodeEdgeNet< TNodeData, TEdgeData >::IsNode().

1446  {
1447  if (! IsNode(SrcNId)) { return false; }
1448  if (! IsNode(DstNId)) { return false; }
1449  const TNode& SrcNode = GetNode(SrcNId);
1450  for (int edge = 0; edge < SrcNode.GetOutDeg(); edge++) {
1451  const TEdge& Edge = GetEdge(SrcNode.GetOutEId(edge));
1452  if (DstNId == Edge.GetDstNId()) {
1453  EId = Edge.GetId(); return true; }
1454  }
1455  if (! IsDir) {
1456  for (int edge = 0; edge < SrcNode.GetInDeg(); edge++) {
1457  const TEdge& Edge = GetEdge(SrcNode.GetInEId(edge));
1458  if (DstNId == Edge.GetSrcNId()) {
1459  EId = Edge.GetId(); return true; }
1460  }
1461  }
1462  return false;
1463 }
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
TNodeEdgeNet::GetNode
TNode & GetNode(const int &NId)
Definition: network.h:1141
TNodeEdgeNet::TEdge::GetId
int GetId() const
Definition: network.h:1025
TNodeEdgeNet::GetEdge
TEdge & GetEdge(const int &EId)
Definition: network.h:1144

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
bool TNodeEdgeNet< TNodeData, TEdgeData >::IsNode ( const int &  NId) const
inline

Tests whether ID NId is a node.

Definition at line 1194 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::AddNode(), TTimeNENet::GetESubGraph(), TTimeNENet::GetGraphUpToTm(), TTimeNENet::GetSubGraph(), TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::IsOk(), and TNodeEdgeNet< TNodeData, TEdgeData >::SetNDat().

1194 { return NodeH.IsKey(NId); }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::IsKey
bool IsKey(const TKey &Key) const
Definition: hash.h:216

Here is the caller graph for this function:

template<class TNodeData , class TEdgeData >
bool TNodeEdgeNet< TNodeData, TEdgeData >::IsOk ( const bool &  ThrowExcept = true) const

Checks the network data structure for internal consistency.

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

Definition at line 1506 of file network.h.

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

1506  {
1507  bool RetVal = true;
1508  for (int N = NodeH.FFirstKeyId(); NodeH.FNextKeyId(N); ) {
1509  const TNode& Node = NodeH[N];
1510  if (! Node.OutEIdV.IsSorted()) {
1511  const TStr Msg = TStr::Fmt("Out-edge list of node %d is not sorted.", Node.GetId());
1512  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1513  }
1514  if (! Node.InEIdV.IsSorted()) {
1515  const TStr Msg = TStr::Fmt("In-edge list of node %d is not sorted.", Node.GetId());
1516  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1517  }
1518  // check out-edge ids
1519  int prevEId = -1;
1520  for (int e = 0; e < Node.GetOutDeg(); e++) {
1521  if (! IsEdge(Node.GetOutEId(e))) {
1522  const TStr Msg = TStr::Fmt("Out-edge id %d of node %d does not exist.", Node.GetOutEId(e), Node.GetId());
1523  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1524  }
1525  if (e > 0 && prevEId == Node.GetOutEId(e)) {
1526  const TStr Msg = TStr::Fmt("Node %d has duplidate out-edge id %d.", Node.GetId(), Node.GetOutEId(e));
1527  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1528  }
1529  prevEId = Node.GetOutEId(e);
1530  }
1531  // check in-edge ids
1532  prevEId = -1;
1533  for (int e = 0; e < Node.GetInDeg(); e++) {
1534  if (! IsEdge(Node.GetInEId(e))) {
1535  const TStr Msg = TStr::Fmt("Out-edge id %d of node %d does not exist.", Node.GetInEId(e), Node.GetId());
1536  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1537  }
1538  if (e > 0 && prevEId == Node.GetInEId(e)) {
1539  const TStr Msg = TStr::Fmt("Node %d has duplidate out-edge id %d.", Node.GetId(), Node.GetInEId(e));
1540  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1541  }
1542  prevEId = Node.GetInEId(e);
1543  }
1544  }
1545  for (int E = EdgeH.FFirstKeyId(); EdgeH.FNextKeyId(E); ) {
1546  const TEdge& Edge = EdgeH[E];
1547  if (! IsNode(Edge.GetSrcNId())) {
1548  const TStr Msg = TStr::Fmt("Edge %d source node %d does not exist.", Edge.GetId(), Edge.GetSrcNId());
1549  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1550  }
1551  if (! IsNode(Edge.GetDstNId())) {
1552  const TStr Msg = TStr::Fmt("Edge %d destination node %d does not exist.", Edge.GetId(), Edge.GetDstNId());
1553  if (ThrowExcept) { EAssertR(false, Msg); } else { ErrNotify(Msg.CStr()); } RetVal=false;
1554  }
1555  }
1556  return RetVal;
1557 }
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
ErrNotify
void ErrNotify(const char *NotifyCStr)
Definition: bd.h:74
THash::FNextKeyId
bool FNextKeyId(int &KeyId) const
Definition: hash.h:432
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::FFirstKeyId
int FFirstKeyId() const
Definition: hash.h:232
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240
TStr
Definition: dt.h:412
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599
EAssertR
#define EAssertR(Cond, MsgStr)
Definition: bd.h:283
TStr::CStr
char * CStr()
Definition: dt.h:476

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
static PNet TNodeEdgeNet< TNodeData, TEdgeData >::Load ( TSIn &  SIn)
inlinestatic

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

Definition at line 1165 of file network.h.

1165 { return PNet(new TNet(SIn)); }
TNodeEdgeNet::TNet
TNodeEdgeNet< TNodeData, TEdgeData > TNet
Definition: network.h:982
TNodeEdgeNet::PNet
TPt< TNet > PNet
Definition: network.h:983
template<class TNodeData, class TEdgeData>
static PNet TNodeEdgeNet< TNodeData, TEdgeData >::New ( )
inlinestatic

Static constructor that returns a pointer to the network. Call: TPt <TNodeEdgeNet<TNodeData, TEdgeData> > Net = TNodeEdgeNet<TNodeData, TEdgeData>::New().

Definition at line 1163 of file network.h.

1163 { return PNet(new TNet()); }
TNodeEdgeNet::TNet
TNodeEdgeNet< TNodeData, TEdgeData > TNet
Definition: network.h:982
TNodeEdgeNet::PNet
TPt< TNet > PNet
Definition: network.h:983
template<class TNodeData, class TEdgeData>
TNodeEdgeNet& TNodeEdgeNet< TNodeData, TEdgeData >::operator= ( const TNodeEdgeNet< TNodeData, TEdgeData > &  Net)
inline

Definition at line 1168 of file network.h.

1168  {
1169  if (this!=&Net) { NodeH=Net.NodeH; EdgeH=Net.EdgeH; MxNId=Net.MxNId; MxEId=Net.MxEId; } return *this; }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::Reserve ( const int &  Nodes,
const int &  Edges 
)
inline

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

Definition at line 1281 of file network.h.

Referenced by TTimeNENet::GetESubGraph(), TTimeNENet::GetSubGraph(), TNEANet::TNEANet(), and TNodeEdgeNet< TSecTm, TSecTm >::TNodeEdgeNet().

1281  {
1282  if (Nodes>0) { NodeH.Gen(Nodes/2); } if (Edges>0) { EdgeH.Gen(Edges/2); } }
THash::Gen
void Gen(const int &ExpectVals)
Definition: hash.h:180
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151

Here is the caller graph for this function:

template<class TNodeData, class TEdgeData>
virtual void TNodeEdgeNet< TNodeData, TEdgeData >::Save ( TSOut &  SOut) const
inlinevirtual

Saves the network to a (binary) stream SOut.

Reimplemented in TTimeNENet.

Definition at line 1161 of file network.h.

1161 { MxNId.Save(SOut); MxEId.Save(SOut); NodeH.Save(SOut); EdgeH.Save(SOut); }
TNodeEdgeNet::MxEId
TInt MxEId
Definition: network.h:1149
TInt::Save
void Save(TSOut &SOut) const
Definition: dt.h:1058
THash::Save
void Save(TSOut &SOut) const
Definition: hash.h:141
TNodeEdgeNet::MxNId
TInt MxNId
Definition: network.h:1149
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
template<class TNodeData , class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::SetAllEDat ( const TEdgeData &  EdgeDat)

Sets edge data for all the edges in the network to EDat.

Definition at line 1472 of file network.h.

References TNodeEdgeNet< TNodeData, TEdgeData >::BegEI(), and TNodeEdgeNet< TNodeData, TEdgeData >::EndEI().

1472  {
1473  for (TEdgeI EI = BegEI(); EI < EndEI(); EI++) {
1474  EI() = EdgeDat;
1475  }
1476 }
TNodeEdgeNet::BegEI
TEdgeI BegEI() const
Returns an iterator referring to the first edge in the network.
Definition: network.h:1247
TNodeEdgeNet::EndEI
TEdgeI EndEI() const
Returns an iterator referring to the past-the-end edge in the network.
Definition: network.h:1249

Here is the call graph for this function:

template<class TNodeData , class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::SetEDat ( const int &  EId,
const TEdgeData &  EdgeDat 
)

Sets edge data for the edge of ID NId in the network.

Definition at line 1466 of file network.h.

References TStr::Fmt(), TNodeEdgeNet< TNodeData, TEdgeData >::TEdgeI::GetDat(), TNodeEdgeNet< TNodeData, TEdgeData >::GetEI(), IAssertR, and TNodeEdgeNet< TNodeData, TEdgeData >::IsEdge().

1466  {
1467  IAssertR(IsEdge(EId), TStr::Fmt("EdgeId %d does not exist.", EId).CStr());
1468  GetEI(EId).GetDat() = EdgeDat;
1469 }
IAssertR
#define IAssertR(Cond, Reason)
Definition: bd.h:265
TNodeEdgeNet::GetEI
TEdgeI GetEI(const int &EId) const
Not supported/implemented!
Definition: network.h:1251
TNodeEdgeNet::TEdgeI::GetDat
const TEdgeData & GetDat() const
Definition: network.h:1131
TNodeEdgeNet::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with ID EId exists in the network.
Definition: network.h:1240
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599

Here is the call graph for this function:

template<class TNodeData, class TEdgeData >
void TNodeEdgeNet< TNodeData, TEdgeData >::SetNDat ( const int &  NId,
const TNodeData &  NodeDat 
)

Sets node data for the node of ID NId in the network.

Definition at line 1385 of file network.h.

References TStr::Fmt(), THash< TKey, TDat, THashFunc >::GetDat(), IAssertR, TNodeEdgeNet< TNodeData, TEdgeData >::IsNode(), TNodeEdgeNet< TNodeData, TEdgeData >::TNode::NodeDat, and TNodeEdgeNet< TNodeData, TEdgeData >::NodeH.

1385  {
1386  IAssertR(IsNode(NId), TStr::Fmt("NodeId %d does not exist.", NId).CStr());
1387  NodeH.GetDat(NId).NodeDat = NodeDat;
1388 }
IAssertR
#define IAssertR(Cond, Reason)
Definition: bd.h:265
TNodeEdgeNet::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: network.h:1194
THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:220
TNodeEdgeNet::TNode::NodeDat
TNodeData NodeDat
Definition: network.h:989
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
TStr::Fmt
static TStr Fmt(const char *FmtStr,...)
Definition: dt.cpp:1599

Here is the call graph for this function:

template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::SortEIdByDat ( const bool &  Asc = true)
inline

Sorts edges by edge data.

Definition at line 1290 of file network.h.

1290 { EdgeH.SortByDat(Asc); }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::SortByDat
void SortByDat(const bool &Asc=true)
Definition: hash.h:246
template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::SortEIdById ( const bool &  Asc = true)
inline

Sorts edges by edge IDs.

Definition at line 1288 of file network.h.

1288 { EdgeH.SortByKey(Asc); }
TNodeEdgeNet::EdgeH
THash< TInt, TEdge > EdgeH
Definition: network.h:1151
THash::SortByKey
void SortByKey(const bool &Asc=true)
Definition: hash.h:245
template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::SortNIdByDat ( const bool &  Asc = true)
inline

Sorts nodes by node data.

Definition at line 1286 of file network.h.

1286 { NodeH.SortByDat(Asc); }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::SortByDat
void SortByDat(const bool &Asc=true)
Definition: hash.h:246
template<class TNodeData, class TEdgeData>
void TNodeEdgeNet< TNodeData, TEdgeData >::SortNIdById ( const bool &  Asc = true)
inline

Sorts nodes by node IDs.

Definition at line 1284 of file network.h.

1284 { NodeH.SortByKey(Asc); }
TNodeEdgeNet::NodeH
THash< TInt, TNode > NodeH
Definition: network.h:1150
THash::SortByKey
void SortByKey(const bool &Asc=true)
Definition: hash.h:245

Friends And Related Function Documentation

template<class TNodeData, class TEdgeData>
friend class TPt< TNodeEdgeNet< TNodeData, TEdgeData > >
friend

Definition at line 1304 of file network.h.

Member Data Documentation

template<class TNodeData, class TEdgeData>
TCRef TNodeEdgeNet< TNodeData, TEdgeData >::CRef
protected

Definition at line 1148 of file network.h.

template<class TNodeData, class TEdgeData>
THash<TInt, TEdge> TNodeEdgeNet< TNodeData, TEdgeData >::EdgeH
protected

Definition at line 1151 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge(), TNodeEdgeNet< TSecTm, TSecTm >::BegEI(), TNEANet::BegEI(), TNodeEdgeNet< TSecTm, TSecTm >::Clr(), TNEANet::Clr(), TNodeEdgeNet< TNodeData, TEdgeData >::Defrag(), TNodeEdgeNet< TNodeData, TEdgeData >::DelEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::DelNode(), TNodeEdgeNet< TSecTm, TSecTm >::EndEI(), TNEANet::EndEI(), TNEANet::GetEAFltI(), TNEANet::GetEAIntI(), TNEANet::GetEAStrI(), TNodeEdgeNet< TSecTm, TSecTm >::GetEDat(), TNodeEdgeNet< TSecTm, TSecTm >::GetEdge(), TNEANet::GetEdge(), TNodeEdgeNet< TSecTm, TSecTm >::GetEdgeKId(), TNodeEdgeNet< TSecTm, TSecTm >::GetEdges(), TNEANet::GetEdges(), TNodeEdgeNet< TSecTm, TSecTm >::GetEI(), TNEANet::GetEI(), TNodeEdgeNet< TNodeData, TEdgeData >::GetEIdV(), TNodeEdgeNet< TSecTm, TSecTm >::GetRndEId(), TNEANet::GetRndEId(), TNodeEdgeNet< TSecTm, TSecTm >::IsEdge(), TNEANet::IsEdge(), TNodeEdgeNet< TNodeData, TEdgeData >::IsOk(), TNodeEdgeNet< TSecTm, TSecTm >::operator=(), TNEANet::operator=(), TNodeEdgeNet< TSecTm, TSecTm >::Reserve(), TNEANet::Reserve(), TNodeEdgeNet< TSecTm, TSecTm >::Save(), TNEANet::Save(), TNodeEdgeNet< TSecTm, TSecTm >::SortEIdByDat(), and TNodeEdgeNet< TSecTm, TSecTm >::SortEIdById().

template<class TNodeData, class TEdgeData>
TInt TNodeEdgeNet< TNodeData, TEdgeData >::MxEId
protected

Definition at line 1149 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddEdge(), TNodeEdgeNet< TSecTm, TSecTm >::Clr(), TNEANet::Clr(), TNEANet::GetMxEId(), TNodeEdgeNet< TSecTm, TSecTm >::operator=(), TNEANet::operator=(), TNodeEdgeNet< TSecTm, TSecTm >::Save(), and TNEANet::Save().

template<class TNodeData, class TEdgeData>
TInt TNodeEdgeNet< TNodeData, TEdgeData >::MxNId
protected

Definition at line 1149 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddNode(), TNodeEdgeNet< TSecTm, TSecTm >::Clr(), TNEANet::Clr(), TNodeEdgeNet< TSecTm, TSecTm >::GetMxNId(), TNEANet::GetMxNId(), TNodeEdgeNet< TSecTm, TSecTm >::operator=(), TNEANet::operator=(), TNodeEdgeNet< TSecTm, TSecTm >::Save(), and TNEANet::Save().

template<class TNodeData, class TEdgeData>
THash<TInt, TNode> TNodeEdgeNet< TNodeData, TEdgeData >::NodeH
protected

Definition at line 1150 of file network.h.

Referenced by TNodeEdgeNet< TNodeData, TEdgeData >::AddNode(), TNodeEdgeNet< TSecTm, TSecTm >::BegNI(), TNEANet::BegNI(), TNodeEdgeNet< TSecTm, TSecTm >::Clr(), TNEANet::Clr(), TNodeEdgeNet< TNodeData, TEdgeData >::Defrag(), TNodeEdgeNet< TNodeData, TEdgeData >::DelNode(), TNodeEdgeNet< TSecTm, TSecTm >::EndNI(), TNEANet::EndNI(), TNEANet::GetNAFltI(), TNEANet::GetNAIntI(), TNEANet::GetNAStrI(), TNodeEdgeNet< TSecTm, TSecTm >::GetNDat(), TNodeEdgeNet< TSecTm, TSecTm >::GetNI(), TNEANet::GetNI(), TNodeEdgeNet< TNodeData, TEdgeData >::GetNIdV(), TNodeEdgeNet< TSecTm, TSecTm >::GetNode(), TNEANet::GetNode(), TNodeEdgeNet< TSecTm, TSecTm >::GetNodeKId(), TNodeEdgeNet< TSecTm, TSecTm >::GetNodes(), TNEANet::GetNodes(), TNodeEdgeNet< TSecTm, TSecTm >::GetRndNId(), TNEANet::GetRndNId(), TNodeEdgeNet< TSecTm, TSecTm >::IsNode(), TNEANet::IsNode(), TNodeEdgeNet< TNodeData, TEdgeData >::IsOk(), TNodeEdgeNet< TSecTm, TSecTm >::operator=(), TNEANet::operator=(), TNodeEdgeNet< TSecTm, TSecTm >::Reserve(), TNEANet::Reserve(), TNodeEdgeNet< TSecTm, TSecTm >::Save(), TNEANet::Save(), TNodeEdgeNet< TNodeData, TEdgeData >::SetNDat(), TNodeEdgeNet< TSecTm, TSecTm >::SortNIdByDat(), and TNodeEdgeNet< TSecTm, TSecTm >::SortNIdById().

The documentation for this class was generated from the following file: