d6/df3/graph_8h_source.html

 //#//////////////////////////////////////////////


 class TUNGraph;

 class TBPGraph;

 //TODO:class TUNEGraph; -- undirected multigraph


 typedef TPt<TUNGraph> PUNGraph;

 typedef TPt<TBPGraph> PBPGraph;


 //#//////////////////////////////////////////////

 class TNGraph;

 class TNEGraph;


 typedef TPt<TNGraph> PNGraph;

 typedef TPt<TNEGraph> PNEGraph;


 //#//////////////////////////////////////////////


 class TUNGraph {

 public:

   typedef TUNGraph TNet;

   typedef TPt<TUNGraph> PNet;

 public:

   class TNode {

   private:

     TInt Id;

     TIntV NIdV;

   public:

     TNode() : Id(-1), NIdV() { }

     TNode(const int& NId) : Id(NId), NIdV() { }

     TNode(const TNode& Node) : Id(Node.Id), NIdV(Node.NIdV) { }

     TNode(TSIn& SIn) : Id(SIn), NIdV(SIn) { }

     void LoadShM(TShMIn& ShMIn) {

       Id = TInt(ShMIn);

       NIdV.LoadShM(ShMIn);

     }

     void Save(TSOut& SOut) const { Id.Save(SOut); NIdV.Save(SOut); }

     int GetId() const { return Id; }

     int GetDeg() const { return NIdV.Len(); }

     int GetInDeg() const { return GetDeg(); }

     int GetOutDeg() const { return GetDeg(); }

     int GetInNId(const int& NodeN) const { return GetNbrNId(NodeN); }

     int GetOutNId(const int& NodeN) const { return GetNbrNId(NodeN); }

     int GetNbrNId(const int& NodeN) const { return NIdV[NodeN]; }

     bool IsNbrNId(const int& NId) const { return NIdV.SearchBin(NId)!=-1; }

     bool IsInNId(const int& NId) const { return IsNbrNId(NId); }

     bool IsOutNId(const int& NId) const { return IsNbrNId(NId); }

     void PackOutNIdV() { NIdV.Pack(); }

     void PackNIdV() { NIdV.Pack(); }

     void SortNIdV() { NIdV.Sort();}

     friend class TUNGraph;

     friend class TUNGraphMtx;

   };

   class TNodeI {

   private:

     typedef THash<TInt, TNode>::TIter THashIter;

     THashIter NodeHI;

   public:

     TNodeI() : NodeHI() { }

     TNodeI(const THashIter& NodeHIter) : NodeHI(NodeHIter) { }

     TNodeI(const TNodeI& NodeI) : NodeHI(NodeI.NodeHI) { }

     TNodeI& operator = (const TNodeI& NodeI) { NodeHI = NodeI.NodeHI; return *this; }


     TNodeI& operator++ (int) { NodeHI++; return *this; }

     TNodeI& operator-- (int) { NodeHI--; return *this; }


     bool operator < (const TNodeI& NodeI) const { return NodeHI < NodeI.NodeHI; }

     bool operator == (const TNodeI& NodeI) const { return NodeHI == NodeI.NodeHI; }


     int GetId() const { return NodeHI.GetDat().GetId(); }

     int GetDeg() const { return NodeHI.GetDat().GetDeg(); }

     int GetInDeg() const { return NodeHI.GetDat().GetInDeg(); }

     int GetOutDeg() const { return NodeHI.GetDat().GetOutDeg(); }

     void SortNIdV() { NodeHI.GetDat().SortNIdV(); }


     int GetInNId(const int& NodeN) const { return NodeHI.GetDat().GetInNId(NodeN); }


     int GetOutNId(const int& NodeN) const { return NodeHI.GetDat().GetOutNId(NodeN); }


     int GetNbrNId(const int& NodeN) const { return NodeHI.GetDat().GetNbrNId(NodeN); }

     bool IsInNId(const int& NId) const { return NodeHI.GetDat().IsInNId(NId); }

     bool IsOutNId(const int& NId) const { return NodeHI.GetDat().IsOutNId(NId); }

     bool IsNbrNId(const int& NId) const { return NodeHI.GetDat().IsNbrNId(NId); }

     friend class TUNGraph;

   };

   class TEdgeI {

   private:

     TNodeI CurNode, EndNode;

     int CurEdge;

   public:

     TEdgeI() : CurNode(), EndNode(), CurEdge(0) { }

     TEdgeI(const TNodeI& NodeI, const TNodeI& EndNodeI, const int& EdgeN=0) : CurNode(NodeI), EndNode(EndNodeI), CurEdge(EdgeN) { }

     TEdgeI(const TEdgeI& EdgeI) : CurNode(EdgeI.CurNode), EndNode(EdgeI.EndNode), CurEdge(EdgeI.CurEdge) { }

     TEdgeI& operator = (const TEdgeI& EdgeI) { if (this!=&EdgeI) { CurNode=EdgeI.CurNode; EndNode=EdgeI.EndNode; CurEdge=EdgeI.CurEdge; } return *this; }

     TEdgeI& operator++ (int) { do { CurEdge++; if (CurEdge >= CurNode.GetOutDeg()) { CurEdge=0; CurNode++; while (CurNode < EndNode && CurNode.GetOutDeg()==0) { CurNode++; } } } while (CurNode < EndNode && GetSrcNId()>GetDstNId()); return *this; }

     bool operator < (const TEdgeI& EdgeI) const { return CurNode<EdgeI.CurNode || (CurNode==EdgeI.CurNode && CurEdge<EdgeI.CurEdge); }

     bool operator == (const TEdgeI& EdgeI) const { return CurNode == EdgeI.CurNode && CurEdge == EdgeI.CurEdge; }

     int GetId() const { return -1; }

     int GetSrcNId() const { return CurNode.GetId(); }

     int GetDstNId() const { return CurNode.GetOutNId(CurEdge); }

     friend class TUNGraph;

   };

 private:

   TCRef CRef;

   TInt MxNId, NEdges;

   THash<TInt, TNode> NodeH;

 private:

   class TLoadTNodeInitializer {

   public:

     TLoadTNodeInitializer() {}

     void operator() (TNode* Node, TShMIn& ShMIn) { Node->LoadShM(ShMIn);}

   };

 private:

   TNode& GetNode(const int& NId) { return NodeH.GetDat(NId); }

   const TNode& GetNode(const int& NId) const { return NodeH.GetDat(NId); }

   void LoadGraphShM(TShMIn& ShMIn) {

     MxNId = TInt(ShMIn);

     NEdges = TInt(ShMIn);

     TLoadTNodeInitializer Fn;

     NodeH.LoadShM(ShMIn, Fn);

   }

 public:

   TUNGraph() : CRef(), MxNId(0), NEdges(0), NodeH() { }

   explicit TUNGraph(const int& Nodes, const int& Edges) : MxNId(0), NEdges(0) { Reserve(Nodes, Edges); }

   TUNGraph(const TUNGraph& Graph) : MxNId(Graph.MxNId), NEdges(Graph.NEdges), NodeH(Graph.NodeH) { }

   TUNGraph(TSIn& SIn) : MxNId(SIn), NEdges(SIn), NodeH(SIn) { }


   void Save(TSOut& SOut) const { MxNId.Save(SOut); NEdges.Save(SOut); NodeH.Save(SOut); }

   static PUNGraph New() { return new TUNGraph(); }


   static PUNGraph New(const int& Nodes, const int& Edges) { return new TUNGraph(Nodes, Edges); }

   static PUNGraph Load(TSIn& SIn) { return PUNGraph(new TUNGraph(SIn)); }


   static PUNGraph LoadShM(TShMIn& ShMIn) {

     TUNGraph* Graph = new TUNGraph();

     Graph->LoadGraphShM(ShMIn);

     return PUNGraph(Graph);

   }

   bool HasFlag(const TGraphFlag& Flag) const;

   TUNGraph& operator = (const TUNGraph& Graph) {

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


   int GetNodes() const { return NodeH.Len(); }


   int AddNode(int NId = -1);


   int AddNodeUnchecked(int NId = -1);

   int AddNode(const TNodeI& NodeI) { return AddNode(NodeI.GetId()); }


   int AddNode(const int& NId, const TIntV& NbrNIdV);


   int AddNode(const int& NId, const TVecPool<TInt>& Pool, const int& NIdVId);


   void DelNode(const int& NId);

   void DelNode(const TNode& NodeI) { DelNode(NodeI.GetId()); }

   bool IsNode(const int& NId) const { return NodeH.IsKey(NId); }

   TNodeI BegNI() const { return TNodeI(NodeH.BegI()); }

   TNodeI EndNI() const { return TNodeI(NodeH.EndI()); }

   TNodeI GetNI(const int& NId) const { return TNodeI(NodeH.GetI(NId)); }

   int GetMxNId() const { return MxNId; }


   int GetEdges() const;


   int AddEdge(const int& SrcNId, const int& DstNId);

   int AddEdge(const int& SrcNId, const int& DstNId, const int& EId) { return AddEdge(SrcNId, DstNId); }


   int AddEdgeUnchecked(const int& SrcNId, const int& DstNId);

   int AddEdge2(const int& SrcNId, const int& DstNId);

   int AddEdge(const TEdgeI& EdgeI) { return AddEdge(EdgeI.GetSrcNId(), EdgeI.GetDstNId()); }


   void DelEdge(const int& SrcNId, const int& DstNId);

   bool IsEdge(const int& SrcNId, const int& DstNId) const;

   bool IsEdge(const int& EId) const { return false; }

   TEdgeI BegEI() const { TNodeI NI = BegNI(); TEdgeI EI(NI, EndNI(), 0); if (GetNodes() != 0 && (NI.GetOutDeg()==0 || NI.GetId()>NI.GetOutNId(0))) { EI++; } return EI; }

   TEdgeI EndEI() const { return TEdgeI(EndNI(), EndNI()); }

   TEdgeI GetEI(const int& EId) const;


   TEdgeI GetEI(const int& SrcNId, const int& DstNId) const;


   int GetRndNId(TRnd& Rnd=TInt::Rnd) { return NodeH.GetKey(NodeH.GetRndKeyId(Rnd, 0.8)); }

   TNodeI GetRndNI(TRnd& Rnd=TInt::Rnd) { return GetNI(GetRndNId(Rnd)); }

   void GetNIdV(TIntV& NIdV) const;


   bool Empty() const { return GetNodes()==0; }

   void Clr() { MxNId=0; NEdges=0; NodeH.Clr(); }

   void SortNodeAdjV() { for (TNodeI NI = BegNI(); NI < EndNI(); NI++) { NI.SortNIdV();} }

   void Reserve(const int& Nodes, const int& Edges) { if (Nodes>0) NodeH.Gen(Nodes/2); }

   void ReserveNIdDeg(const int& NId, const int& Deg) { GetNode(NId).NIdV.Reserve(Deg); }


   void Defrag(const bool& OnlyNodeLinks=false);


   bool IsOk(const bool& ThrowExcept=true) const;

   void Dump(FILE *OutF=stdout) const;


   static PUNGraph GetSmallGraph();


   friend class TUNGraphMtx;

   friend class TPt<TUNGraph>;

 };


 //#//////////////////////////////////////////////


 class TNGraph {

 public:

   typedef TNGraph TNet;

   typedef TPt<TNGraph> PNet;

 public:

   class TNode {

   private:

     TInt Id;

     TIntV InNIdV, OutNIdV;

   public:

     TNode() : Id(-1), InNIdV(), OutNIdV() { }

     TNode(const int& NId) : Id(NId), InNIdV(), OutNIdV() { }

     TNode(const TNode& Node) : Id(Node.Id), InNIdV(Node.InNIdV), OutNIdV(Node.OutNIdV) { }

     TNode(TSIn& SIn) : Id(SIn), InNIdV(SIn), OutNIdV(SIn) { }

     void Save(TSOut& SOut) const { Id.Save(SOut); InNIdV.Save(SOut); OutNIdV.Save(SOut); }

     int GetId() const { return Id; }

     int GetDeg() const { return GetInDeg() + GetOutDeg(); }

     int GetInDeg() const { return InNIdV.Len(); }

     int GetOutDeg() const { return OutNIdV.Len(); }

     int GetInNId(const int& NodeN) const { return InNIdV[NodeN]; }

     int GetOutNId(const int& NodeN) const { return OutNIdV[NodeN]; }

     int GetNbrNId(const int& NodeN) const { return NodeN<GetOutDeg()?GetOutNId(NodeN):GetInNId(NodeN-GetOutDeg()); }

     bool IsInNId(const int& NId) const { return InNIdV.SearchBin(NId) != -1; }

     bool IsOutNId(const int& NId) const { return OutNIdV.SearchBin(NId) != -1; }

     bool IsNbrNId(const int& NId) const { return IsOutNId(NId) || IsInNId(NId); }

     void PackOutNIdV() { OutNIdV.Pack(); }

     void PackNIdV() { InNIdV.Pack(); }

     void SortNIdV() { InNIdV.Sort(); OutNIdV.Sort();}

     void LoadShM(TShMIn& ShMIn) {

       Id = TInt(ShMIn);

       InNIdV.LoadShM(ShMIn);

       OutNIdV.LoadShM(ShMIn);

     }

     friend class TNGraph;

     friend class TNGraphMtx;

   };

   class TNodeI {

   private:

     typedef THash<TInt, TNode>::TIter THashIter;

     THashIter NodeHI;

   public:

     TNodeI() : NodeHI() { }

     TNodeI(const THashIter& NodeHIter) : NodeHI(NodeHIter) { }

     TNodeI(const TNodeI& NodeI) : NodeHI(NodeI.NodeHI) { }

     TNodeI& operator = (const TNodeI& NodeI) { NodeHI = NodeI.NodeHI; return *this; }

     TNodeI& operator++ (int) { NodeHI++; return *this; }

     TNodeI& operator-- (int) { NodeHI--; return *this; }


     bool operator < (const TNodeI& NodeI) const { return NodeHI < NodeI.NodeHI; }

     bool operator == (const TNodeI& NodeI) const { return NodeHI == NodeI.NodeHI; }

     int GetId() const { return NodeHI.GetDat().GetId(); }

     int GetDeg() const { return NodeHI.GetDat().GetDeg(); }

     int GetInDeg() const { return NodeHI.GetDat().GetInDeg(); }

     int GetOutDeg() const { return NodeHI.GetDat().GetOutDeg(); }

     void SortNIdV() { NodeHI.GetDat().SortNIdV(); }


     int GetInNId(const int& NodeN) const { return NodeHI.GetDat().GetInNId(NodeN); }


     int GetOutNId(const int& NodeN) const { return NodeHI.GetDat().GetOutNId(NodeN); }


     int GetNbrNId(const int& NodeN) const { return NodeHI.GetDat().GetNbrNId(NodeN); }

     bool IsInNId(const int& NId) const { return NodeHI.GetDat().IsInNId(NId); }

     bool IsOutNId(const int& NId) const { return NodeHI.GetDat().IsOutNId(NId); }

     bool IsNbrNId(const int& NId) const { return IsOutNId(NId) || IsInNId(NId); }

     friend class TNGraph;

   };

   class TEdgeI {

   private:

     TNodeI CurNode, EndNode;

     int CurEdge;

   public:

     TEdgeI() : CurNode(), EndNode(), CurEdge(0) { }

     TEdgeI(const TNodeI& NodeI, const TNodeI& EndNodeI, const int& EdgeN=0) : CurNode(NodeI), EndNode(EndNodeI), CurEdge(EdgeN) { }

     TEdgeI(const TEdgeI& EdgeI) : CurNode(EdgeI.CurNode), EndNode(EdgeI.EndNode), CurEdge(EdgeI.CurEdge) { }

     TEdgeI& operator = (const TEdgeI& EdgeI) { if (this!=&EdgeI) { CurNode=EdgeI.CurNode; EndNode=EdgeI.EndNode; CurEdge=EdgeI.CurEdge; }  return *this; }

     TEdgeI& operator++ (int) { CurEdge++; if (CurEdge >= CurNode.GetOutDeg()) { CurEdge=0; CurNode++;

       while (CurNode < EndNode && CurNode.GetOutDeg()==0) { CurNode++; } }  return *this; }

     bool operator < (const TEdgeI& EdgeI) const { return CurNode<EdgeI.CurNode || (CurNode==EdgeI.CurNode && CurEdge<EdgeI.CurEdge); }

     bool operator == (const TEdgeI& EdgeI) const { return CurNode == EdgeI.CurNode && CurEdge == EdgeI.CurEdge; }

     int GetId() const { return -1; }

     int GetSrcNId() const { return CurNode.GetId(); }

     int GetDstNId() const { return CurNode.GetOutNId(CurEdge); }

     friend class TNGraph;

   };

 private:

   TCRef CRef;

   TInt MxNId;

   THash<TInt, TNode> NodeH;

 private:

   class TLoadTNodeInitializer {

   public:

     TLoadTNodeInitializer() {}

     void operator() (TNode* Node, TShMIn& ShMIn) {Node->LoadShM(ShMIn);}

   };

 private:

   TNode& GetNode(const int& NId) { return NodeH.GetDat(NId); }

   const TNode& GetNode(const int& NId) const { return NodeH.GetDat(NId); }

   void LoadGraphShM(TShMIn& ShMIn) {

     MxNId = TInt(ShMIn);

     TLoadTNodeInitializer Fn;

     NodeH.LoadShM(ShMIn, Fn);

   }


 public:

   TNGraph() : CRef(), MxNId(0), NodeH() { }

   explicit TNGraph(const int& Nodes, const int& Edges) : MxNId(0) { Reserve(Nodes, Edges); }

   TNGraph(const TNGraph& Graph) : MxNId(Graph.MxNId), NodeH(Graph.NodeH) { }

   TNGraph(TSIn& SIn) : MxNId(SIn), NodeH(SIn) { }

   void Save(TSOut& SOut) const { MxNId.Save(SOut); NodeH.Save(SOut); }

   static PNGraph New() { return new TNGraph(); }


   static PNGraph New(const int& Nodes, const int& Edges) { return new TNGraph(Nodes, Edges); }

   static PNGraph Load(TSIn& SIn) { return PNGraph(new TNGraph(SIn)); }


   static PNGraph LoadShM(TShMIn& ShMIn) {

     TNGraph* Graph = new TNGraph();

     Graph->LoadGraphShM(ShMIn);

     return PNGraph(Graph);

   }

   bool HasFlag(const TGraphFlag& Flag) const;

   TNGraph& operator = (const TNGraph& Graph) {

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


   int GetNodes() const { return NodeH.Len(); }


   int AddNode(int NId = -1);


   int AddNodeUnchecked(int NId = -1);

   int AddNode(const TNodeI& NodeId) { return AddNode(NodeId.GetId()); }


   int AddNode(const int& NId, const TIntV& InNIdV, const TIntV& OutNIdV);


   int AddNode(const int& NId, const TVecPool<TInt>& Pool, const int& SrcVId, const int& DstVId);


   void DelNode(const int& NId);

   void DelNode(const TNode& NodeI) { DelNode(NodeI.GetId()); }

   bool IsNode(const int& NId) const { return NodeH.IsKey(NId); }

   TNodeI BegNI() const { return TNodeI(NodeH.BegI()); }

   TNodeI EndNI() const { return TNodeI(NodeH.EndI()); }

   TNodeI GetNI(const int& NId) const { return TNodeI(NodeH.GetI(NId)); }

   // GetNodeC() has been commented out. It was a quick shortcut, do not use.

   //const TNode& GetNodeC(const int& NId) const { return NodeH.GetDat(NId); }

   int GetMxNId() const { return MxNId; }


   int GetEdges() const;


   int AddEdge(const int& SrcNId, const int& DstNId);

   int AddEdge(const int& SrcNId, const int& DstNId, const int& EId) { return AddEdge(SrcNId, DstNId); }


   int AddEdgeUnchecked(const int& SrcNId, const int& DstNId);

   int AddEdge2(const int& SrcNId, const int& DstNId);

   int AddEdge(const TEdgeI& EdgeI) { return AddEdge(EdgeI.GetSrcNId(), EdgeI.GetDstNId()); }


   void DelEdge(const int& SrcNId, const int& DstNId, const bool& IsDir = true);

   bool IsEdge(const int& SrcNId, const int& DstNId, const bool& IsDir = true) const;

   bool IsEdge(const int& EId) const { return false; }

   TEdgeI BegEI() const { TNodeI NI=BegNI(); while(NI<EndNI() && NI.GetOutDeg()==0){NI++;} return TEdgeI(NI, EndNI()); }

   TEdgeI EndEI() const { return TEdgeI(EndNI(), EndNI()); }

   TEdgeI GetEI(const int& EId) const; // not supported

   TEdgeI GetEI(const int& SrcNId, const int& DstNId) const;


   int GetRndNId(TRnd& Rnd=TInt::Rnd) { return NodeH.GetKey(NodeH.GetRndKeyId(Rnd, 0.8)); }

   TNodeI GetRndNI(TRnd& Rnd=TInt::Rnd) { return GetNI(GetRndNId(Rnd)); }

   void GetNIdV(TIntV& NIdV) const;


   bool Empty() const { return GetNodes()==0; }

   void Clr() { MxNId=0; NodeH.Clr(); }

   void Reserve(const int& Nodes, const int& Edges) { if (Nodes>0) { NodeH.Gen(Nodes/2); } }

   void ReserveNIdInDeg(const int& NId, const int& InDeg) { GetNode(NId).InNIdV.Reserve(InDeg); }

   void ReserveNIdOutDeg(const int& NId, const int& OutDeg) { GetNode(NId).OutNIdV.Reserve(OutDeg); }

   void SortNodeAdjV() { for (TNodeI NI = BegNI(); NI < EndNI(); NI++) { NI.SortNIdV();} }


   void Defrag(const bool& OnlyNodeLinks=false);


   bool IsOk(const bool& ThrowExcept=true) const;

   void Dump(FILE *OutF=stdout) const;


   static PNGraph GetSmallGraph();

   friend class TPt<TNGraph>;

   friend class TNGraphMtx;

 };


 // set flags

 namespace TSnap {

 template <> struct IsDirected<TNGraph> { enum { Val = 1 }; };

 }


 //#//////////////////////////////////////////////


 class TNEGraph {

 public:

   typedef TNEGraph TNet;

   typedef TPt<TNEGraph> PNet;

 public:

   class TNode {

   private:

     TInt Id;

     TIntV InEIdV, OutEIdV;

   public:

     TNode() : Id(-1), InEIdV(), OutEIdV() { }

     TNode(const int& NId) : Id(NId), InEIdV(), OutEIdV() { }

     TNode(const TNode& Node) : Id(Node.Id), InEIdV(Node.InEIdV), OutEIdV(Node.OutEIdV) { }

     TNode(TSIn& SIn) : Id(SIn), InEIdV(SIn), OutEIdV(SIn) { }

     void Save(TSOut& SOut) const { Id.Save(SOut); InEIdV.Save(SOut); OutEIdV.Save(SOut); }

     int GetId() const { return Id; }

     int GetDeg() const { return GetInDeg() + GetOutDeg(); }

     int GetInDeg() const { return InEIdV.Len(); }

     int GetOutDeg() const { return OutEIdV.Len(); }

     int GetInEId(const int& EdgeN) const { return InEIdV[EdgeN]; }

     int GetOutEId(const int& EdgeN) const { return OutEIdV[EdgeN]; }

     int GetNbrEId(const int& EdgeN) const { return EdgeN<GetOutDeg()?GetOutEId(EdgeN):GetInEId(EdgeN-GetOutDeg()); }

     bool IsInEId(const int& EId) const { return InEIdV.SearchBin(EId) != -1; }

     bool IsOutEId(const int& EId) const { return OutEIdV.SearchBin(EId) != -1; }

     friend class TNEGraph;

   };

   class TEdge {

   private:

     TInt Id, SrcNId, DstNId;

   public:

     TEdge() : Id(-1), SrcNId(-1), DstNId(-1) { }

     TEdge(const int& EId, const int& SourceNId, const int& DestNId) : Id(EId), SrcNId(SourceNId), DstNId(DestNId) { }

     TEdge(const TEdge& Edge) : Id(Edge.Id), SrcNId(Edge.SrcNId), DstNId(Edge.DstNId) { }

     TEdge(TSIn& SIn) : Id(SIn), SrcNId(SIn), DstNId(SIn) { }

     void Save(TSOut& SOut) const { Id.Save(SOut); SrcNId.Save(SOut); DstNId.Save(SOut); }

     int GetId() const { return Id; }

     int GetSrcNId() const { return SrcNId; }

     int GetDstNId() const { return DstNId; }

     friend class TNEGraph;

   };

   class TNodeI {

   private:

     typedef THash<TInt, TNode>::TIter THashIter;

     THashIter NodeHI;

     const TNEGraph *Graph;

   public:

     TNodeI() : NodeHI(), Graph(NULL) { }

     TNodeI(const THashIter& NodeHIter, const TNEGraph* GraphPt) : NodeHI(NodeHIter), Graph(GraphPt) { }

     TNodeI(const TNodeI& NodeI) : NodeHI(NodeI.NodeHI), Graph(NodeI.Graph) { }

     TNodeI& operator = (const TNodeI& NodeI) { NodeHI = NodeI.NodeHI; Graph=NodeI.Graph; return *this; }

     TNodeI& operator++ (int) { NodeHI++; return *this; }

     TNodeI& operator-- (int) { NodeHI--; return *this; }


     bool operator < (const TNodeI& NodeI) const { return NodeHI < NodeI.NodeHI; }

     bool operator == (const TNodeI& NodeI) const { return NodeHI == NodeI.NodeHI; }

     int GetId() const { return NodeHI.GetDat().GetId(); }

     int GetDeg() const { return NodeHI.GetDat().GetDeg(); }

     int GetInDeg() const { return NodeHI.GetDat().GetInDeg(); }

     int GetOutDeg() const { return NodeHI.GetDat().GetOutDeg(); }


     int GetInNId(const int& EdgeN) const { return Graph->GetEdge(NodeHI.GetDat().GetInEId(EdgeN)).GetSrcNId(); }


     int GetOutNId(const int& EdgeN) const { return Graph->GetEdge(NodeHI.GetDat().GetOutEId(EdgeN)).GetDstNId(); }


     int GetNbrNId(const int& EdgeN) const { const TEdge& E = Graph->GetEdge(NodeHI.GetDat().GetNbrEId(EdgeN));

       return GetId()==E.GetSrcNId() ? E.GetDstNId():E.GetSrcNId(); }

     bool IsInNId(const int& NId) const;

     bool IsOutNId(const int& NId) const;

     bool IsNbrNId(const int& NId) const { return IsOutNId(NId) || IsInNId(NId); }

     // edges

     int GetInEId(const int& EdgeN) const { return NodeHI.GetDat().GetInEId(EdgeN); }

     int GetOutEId(const int& EdgeN) const { return NodeHI.GetDat().GetOutEId(EdgeN); }

     int GetNbrEId(const int& EdgeN) const { return NodeHI.GetDat().GetNbrEId(EdgeN); }

     bool IsInEId(const int& EId) const { return NodeHI.GetDat().IsInEId(EId); }

     bool IsOutEId(const int& EId) const { return NodeHI.GetDat().IsOutEId(EId); }

     bool IsNbrEId(const int& EId) const { return IsInEId(EId) || IsOutEId(EId); }

     friend class TNEGraph;

   };

   class TEdgeI {

   private:

     typedef THash<TInt, TEdge>::TIter THashIter;

     THashIter EdgeHI;

     const TNEGraph *Graph;

   public:

     TEdgeI() : EdgeHI(), Graph(NULL) { }

     TEdgeI(const THashIter& EdgeHIter, const TNEGraph *GraphPt) : EdgeHI(EdgeHIter), Graph(GraphPt) { }

     TEdgeI(const TEdgeI& EdgeI) : EdgeHI(EdgeI.EdgeHI), Graph(EdgeI.Graph) { }

     TEdgeI& operator = (const TEdgeI& EdgeI) { if (this!=&EdgeI) { EdgeHI=EdgeI.EdgeHI; Graph=EdgeI.Graph; }  return *this; }

     TEdgeI& operator++ (int) { EdgeHI++; return *this; }

     bool operator < (const TEdgeI& EdgeI) const { return EdgeHI < EdgeI.EdgeHI; }

     bool operator == (const TEdgeI& EdgeI) const { return EdgeHI == EdgeI.EdgeHI; }

     int GetId() const { return EdgeHI.GetDat().GetId(); }

     int GetSrcNId() const { return EdgeHI.GetDat().GetSrcNId(); }

     int GetDstNId() const { return EdgeHI.GetDat().GetDstNId(); }

     friend class TNEGraph;

   };


 private:

   TNode& GetNode(const int& NId) { return NodeH.GetDat(NId); }

   const TNode& GetNode(const int& NId) const { return NodeH.GetDat(NId); }

   TEdge& GetEdge(const int& EId) { return EdgeH.GetDat(EId); }

   const TEdge& GetEdge(const int& EId) const { return EdgeH.GetDat(EId); }

 private:

   TCRef CRef;

   TInt MxNId, MxEId;

   THash<TInt, TNode> NodeH;

   THash<TInt, TEdge> EdgeH;

 public:

   TNEGraph() : CRef(), MxNId(0), MxEId(0) { }

   explicit TNEGraph(const int& Nodes, const int& Edges) : CRef(), MxNId(0), MxEId(0) { Reserve(Nodes, Edges); }

   TNEGraph(const TNEGraph& Graph) : MxNId(Graph.MxNId), MxEId(Graph.MxEId), NodeH(Graph.NodeH), EdgeH(Graph.EdgeH) { }

   TNEGraph(TSIn& SIn) : MxNId(SIn), MxEId(SIn), NodeH(SIn), EdgeH(SIn) { }

   void Save(TSOut& SOut) const { MxNId.Save(SOut); MxEId.Save(SOut); NodeH.Save(SOut); EdgeH.Save(SOut); }

   static PNEGraph New() { return PNEGraph(new TNEGraph()); }


   static PNEGraph New(const int& Nodes, const int& Edges) { return PNEGraph(new TNEGraph(Nodes, Edges)); }

   static PNEGraph Load(TSIn& SIn) { return PNEGraph(new TNEGraph(SIn)); }

   bool HasFlag(const TGraphFlag& Flag) const;

   TNEGraph& operator = (const TNEGraph& Graph) { if (this!=&Graph) {

     MxNId=Graph.MxNId; MxEId=Graph.MxEId; NodeH=Graph.NodeH; EdgeH=Graph.EdgeH; }  return *this; }


   int GetNodes() const { return NodeH.Len(); }


   int AddNode(int NId = -1);

   int AddNode(const TNodeI& NodeId) { return AddNode(NodeId.GetId()); }


   void DelNode(const int& NId);

   void DelNode(const TNode& NodeI) { DelNode(NodeI.GetId()); }

   bool IsNode(const int& NId) const { return NodeH.IsKey(NId); }

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

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

   TNodeI GetNI(const int& NId) const { return TNodeI(NodeH.GetI(NId), this); }

   int GetMxNId() const { return MxNId; }


   int GetEdges() const { return EdgeH.Len(); }


   int AddEdge(const int& SrcNId, const int& DstNId, int EId  = -1);

   int AddEdge(const TEdgeI& EdgeI) { return AddEdge(EdgeI.GetSrcNId(), EdgeI.GetDstNId(), EdgeI.GetId()); }

   void DelEdge(const int& EId);


   void DelEdge(const int& SrcNId, const int& DstNId, const bool& IsDir = true);

   bool IsEdge(const int& EId) const { return EdgeH.IsKey(EId); }

   bool IsEdge(const int& SrcNId, const int& DstNId, const bool& IsDir = true) const { int EId; return IsEdge(SrcNId, DstNId, EId, IsDir); }

   bool IsEdge(const int& SrcNId, const int& DstNId, int& EId, const bool& IsDir = true) const;

   int GetEId(const int& SrcNId, const int& DstNId) const { int EId; return IsEdge(SrcNId, DstNId, EId)?EId:-1; }

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

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

   TEdgeI GetEI(const int& EId) const { return TEdgeI(EdgeH.GetI(EId), this); }

   TEdgeI GetEI(const int& SrcNId, const int& DstNId) const { return GetEI(GetEId(SrcNId, DstNId)); }


   int GetRndNId(TRnd& Rnd=TInt::Rnd) { return NodeH.GetKey(NodeH.GetRndKeyId(Rnd, 0.8)); }

   TNodeI GetRndNI(TRnd& Rnd=TInt::Rnd) { return GetNI(GetRndNId(Rnd)); }

   int GetRndEId(TRnd& Rnd=TInt::Rnd) { return EdgeH.GetKey(EdgeH.GetRndKeyId(Rnd, 0.8)); }

   TEdgeI GetRndEI(TRnd& Rnd=TInt::Rnd) { return GetEI(GetRndEId(Rnd)); }

   void GetNIdV(TIntV& NIdV) const;

   void GetEIdV(TIntV& EIdV) const;


   bool Empty() const { return GetNodes()==0; }

   void Clr() { MxNId=0; MxEId=0; NodeH.Clr(); EdgeH.Clr(); }

   void Reserve(const int& Nodes, const int& Edges) {

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


   void Defrag(const bool& OnlyNodeLinks=false);


   bool IsOk(const bool& ThrowExcept=true) const;

   void Dump(FILE *OutF=stdout) const;


   static PNEGraph GetSmallGraph();

   friend class TPt<TNEGraph>;

 };


 // set flags

 namespace TSnap {

 template <> struct IsMultiGraph<TNEGraph> { enum { Val = 1 }; };

 template <> struct IsDirected<TNEGraph> { enum { Val = 1 }; };

 }


 //#//////////////////////////////////////////////


 class TBPGraph {

 public:

   typedef TBPGraph TNet;

   typedef TPt<TBPGraph> PNet;

   typedef enum { bgsUndef, bgsLeft, bgsRight, bgsBoth } TNodeTy; // left or right hand side node

 public:

   class TNode {

   private:

     TInt Id;

     TIntV NIdV;

     TNodeTy NodeTy; // remove

   public:

     TNode() : Id(-1), NIdV(), NodeTy(bgsUndef) { }

     TNode(const int& NId) : Id(NId), NIdV(), NodeTy(true?bgsLeft:bgsRight) { }

     TNode(const TNode& Node) : Id(Node.Id), NIdV(Node.NIdV), NodeTy(Node.NodeTy) { }

     TNode(TSIn& SIn) : Id(SIn), NIdV(SIn), NodeTy(bgsUndef) { TInt Ty(SIn); NodeTy=(TNodeTy)Ty.Val; }

     void Save(TSOut& SOut) const { Id.Save(SOut); NIdV.Save(SOut); TInt(NodeTy).Save(SOut); }

     int GetId() const { return Id; }

     int GetDeg() const { return NIdV.Len(); }

     int GetInDeg() const { return GetDeg(); }

     int GetOutDeg() const { return GetDeg(); }

     int GetInNId(const int& NodeN) const { return GetNbrNId(NodeN); }

     int GetOutNId(const int& NodeN) const { return GetNbrNId(NodeN); }

     int GetNbrNId(const int& NodeN) const { return NIdV[NodeN]; }

     bool IsNbrNId(const int& NId) const { return NIdV.SearchBin(NId)!=-1; }

     bool IsInNId(const int& NId) const { return IsNbrNId(NId); }

     bool IsOutNId(const int& NId) const { return IsNbrNId(NId); }

     void PackOutNIdV() { NIdV.Pack(); }

     void PackNIdV() { NIdV.Pack(); }

     friend class TBPGraph;

   };

   class TNodeI {

   private:

     typedef THash<TInt, TNode>::TIter THashIter;

     THashIter LeftHI, RightHI; // iterator over left and right hand-side nodes

   private:

     inline THashIter HI() const { return ! LeftHI.IsEnd()?LeftHI:RightHI; }

   public:

     TNodeI() : LeftHI(), RightHI() { }

     TNodeI(const THashIter& LeftHIter, const THashIter& RightHIter) : LeftHI(LeftHIter), RightHI(RightHIter) { }

     TNodeI(const TNodeI& NodeI) : LeftHI(NodeI.LeftHI), RightHI(NodeI.RightHI) { }

     TNodeI& operator = (const TNodeI& NodeI) { LeftHI = NodeI.LeftHI; RightHI=NodeI.RightHI; return *this; }

     TNodeI& operator++ (int) {

       if (! LeftHI.IsEnd()) {

         LeftHI++; }

       else if (! RightHI.IsEnd()) {

         RightHI++; }

       return *this; }

     bool operator < (const TNodeI& NodeI) const { return LeftHI < NodeI.LeftHI || (LeftHI==NodeI.LeftHI && RightHI < NodeI.RightHI); }

     bool operator == (const TNodeI& NodeI) const { return LeftHI==NodeI.LeftHI && RightHI==NodeI.RightHI; }

     int GetId() const { return HI().GetDat().GetId(); }

     bool IsLeft() const { return ! LeftHI.IsEnd(); }

     bool IsRight() const { return ! IsLeft(); }

     int GetDeg() const { return HI().GetDat().GetDeg(); }

     int GetInDeg() const { return HI().GetDat().GetInDeg(); }

     int GetOutDeg() const { return HI().GetDat().GetOutDeg(); }


     int GetInNId(const int& NodeN) const { return HI().GetDat().GetInNId(NodeN); }


     int GetOutNId(const int& NodeN) const { return HI().GetDat().GetOutNId(NodeN); }


     int GetNbrNId(const int& NodeN) const { return HI().GetDat().GetNbrNId(NodeN); }

     bool IsInNId(const int& NId) const { return HI().GetDat().IsInNId(NId); }

     bool IsOutNId(const int& NId) const { return HI().GetDat().IsOutNId(NId); }

     bool IsNbrNId(const int& NId) const { return HI().GetDat().IsNbrNId(NId); }

     friend class TBPGraph;

   };

   class TEdgeI {

   private:

     TNodeI CurNode, EndNode; // end node on the 'left'

     int CurEdge;

   public:

     TEdgeI() : CurNode(), EndNode(), CurEdge(0) { }

     TEdgeI(const TNodeI& NodeI, const TNodeI& EndNodeI, const int& EdgeN=0) : CurNode(NodeI), EndNode(EndNodeI), CurEdge(EdgeN) { }

     TEdgeI(const TEdgeI& EdgeI) : CurNode(EdgeI.CurNode), EndNode(EdgeI.EndNode), CurEdge(EdgeI.CurEdge) { }

     TEdgeI& operator = (const TEdgeI& EdgeI) { if (this!=&EdgeI) { CurNode=EdgeI.CurNode; EndNode=EdgeI.EndNode; CurEdge=EdgeI.CurEdge; }  return *this; }

     TEdgeI& operator++ (int) { CurEdge++; if (CurEdge >= CurNode.GetOutDeg()) { CurEdge=0; CurNode++;

       while (CurNode < EndNode && CurNode.GetOutDeg()==0) { CurNode++; } }  return *this; }

     bool operator < (const TEdgeI& EdgeI) const { return CurNode<EdgeI.CurNode || (CurNode==EdgeI.CurNode && CurEdge<EdgeI.CurEdge); }

     bool operator == (const TEdgeI& EdgeI) const { return CurNode == EdgeI.CurNode && CurEdge == EdgeI.CurEdge; }

     int GetId() const { return -1; }

     int GetSrcNId() const { return CurNode.GetId(); }

     int GetDstNId() const { return CurNode.GetOutNId(CurEdge); }

     int GetLNId() const { return GetSrcNId(); }

     int GetRNId() const { return GetDstNId(); }

     friend class TBPGraph;

   };

 private:

   TCRef CRef;

   TInt MxNId;                 // maximum node ID in the graph

   THash<TInt, TNode> LeftH;   // 'left' nodes

   THash<TInt, TNode> RightH;  // 'right' nodes

 private:

   //TNode& GetNode(const int& NId) { return NodeH.GetDat(NId); }

   //const TNode& GetNode(const int& NId) const { return NodeH.GetDat(NId); }

 public:

   TBPGraph() : CRef(), MxNId(0), LeftH(), RightH() { }

   explicit TBPGraph(const int& Nodes, const int& Edges) : MxNId(0) { }

   TBPGraph(const TBPGraph& BPGraph) : MxNId(BPGraph.MxNId), LeftH(BPGraph.LeftH), RightH(BPGraph.RightH) { }

   TBPGraph(TSIn& SIn) : MxNId(SIn), LeftH(SIn), RightH(SIn) { }

   void Save(TSOut& SOut) const { MxNId.Save(SOut); LeftH.Save(SOut); RightH.Save(SOut); }

   static PBPGraph New() { return new TBPGraph(); }


   static PBPGraph New(const int& Nodes, const int& Edges) { return new TBPGraph(Nodes, Edges); }

   static PBPGraph Load(TSIn& SIn) { return PBPGraph(new TBPGraph(SIn)); }

   bool HasFlag(const TGraphFlag& Flag) const;

   TBPGraph& operator = (const TBPGraph& BPGraph) {

     if (this!=&BPGraph) { MxNId=BPGraph.MxNId; LeftH=BPGraph.LeftH; RightH=BPGraph.RightH; }  return *this; }


   int GetNodes() const { return GetLNodes() + GetRNodes(); }

   int GetLNodes() const { return LeftH.Len(); }

   int GetRNodes() const { return RightH.Len(); }


   int AddNode(int NId = -1, const bool& LeftNode=true);

   int AddNode(const TNodeI& NodeI) { return AddNode(NodeI.GetId(), NodeI.IsLeft()); }


   void DelNode(const int& NId);

   void DelNode(const TNode& NodeI) { DelNode(NodeI.GetId()); }

   bool IsNode(const int& NId) const { return IsLNode(NId) || IsRNode(NId); }

   bool IsLNode(const int& NId) const { return LeftH.IsKey(NId); }

   bool IsRNode(const int& NId) const { return RightH.IsKey(NId); }

   int GetMxNId() const { return MxNId; }


   TNodeI BegNI() const { return TNodeI(LeftH.BegI(), RightH.BegI()); }

   TNodeI EndNI() const { return TNodeI(LeftH.EndI(), RightH.EndI()); }

   TNodeI GetNI(const int& NId) const { return IsLNode(NId) ? TNodeI(LeftH.GetI(NId), RightH.EndI()) : TNodeI(LeftH.EndI(), RightH.GetI(NId)); }

   TNodeI BegLNI() const { return TNodeI(LeftH.BegI(), RightH.EndI()); }

   TNodeI EndLNI() const { return EndNI(); }

   TNodeI BegRNI() const { return TNodeI(LeftH.EndI(), RightH.BegI()); }

   TNodeI EndRNI() const { return EndNI(); }


   int GetEdges() const;


   int AddEdge(const int& LeftNId, const int& RightNId);

   int AddEdge(const TEdgeI& EdgeI) { return AddEdge(EdgeI.GetSrcNId(), EdgeI.GetDstNId()); }


   void DelEdge(const int& LeftNId, const int& RightNId);

   bool IsEdge(const int& LeftNId, const int& RightNId) const;

   TEdgeI BegEI() const { TNodeI NI=BegLNI(); while (NI<EndLNI() && (NI.GetOutDeg()==0 || NI.GetId()>NI.GetOutNId(0))) { NI++; } return TEdgeI(NI, EndLNI()); }

   TEdgeI EndEI() const { return TEdgeI(EndNI(), EndNI()); }

   TEdgeI GetEI(const int& EId) const;


   TEdgeI GetEI(const int& LeftNId, const int& RightNId) const;


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

   int GetRndLNId(TRnd& Rnd=TInt::Rnd);

   int GetRndRNId(TRnd& Rnd=TInt::Rnd);

   TNodeI GetRndNI(TRnd& Rnd=TInt::Rnd) { return GetNI(GetRndNId(Rnd)); }

   void GetNIdV(TIntV& NIdV) const;

   void GetLNIdV(TIntV& NIdV) const;

   void GetRNIdV(TIntV& NIdV) const;


   bool Empty() const { return GetNodes()==0; }

   void Clr() { MxNId=0; LeftH.Clr(); RightH.Clr(); }

   void Reserve(const int& Nodes, const int& Edges);


   void Defrag(const bool& OnlyNodeLinks=false);


   bool IsOk(const bool& ThrowExcept=true) const;

   void Dump(FILE *OutF=stdout) const;


   static PBPGraph GetSmallGraph();


   friend class TPt<TBPGraph>;

 };


 // set flags

 namespace TSnap {

 template <> struct IsBipart<TBPGraph> { enum { Val = 1 }; };

 }


TNGraph::HasFlag
bool HasFlag(const TGraphFlag &Flag) const
Allows for run-time checking the type of the graph (see the TGraphFlag for flags).
Definition: graph.cpp:232

TCRef
Definition: bd.h:440

TBPGraph::GetSmallGraph
static PBPGraph GetSmallGraph()
Returns a small graph on 2 'left', 3 'right' nodes and 4 edges.
Definition: graph.cpp:868

TBPGraph::AddEdge
int AddEdge(const TEdgeI &EdgeI)
Adds an edge between EdgeI.GetLNId() and EdgeI.GetRNId() to the graph.
Definition: graph.h:1119

TUNGraph::TEdgeI
Edge iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:121

TUNGraph::LoadGraphShM
void LoadGraphShM(TShMIn &ShMIn)
Definition: graph.h:155

TNGraph::TNodeI::GetNbrNId
int GetNbrNId(const int &NodeN) const
Returns ID of NodeN-th neighboring node.
Definition: graph.h:420

TBPGraph::TNodeI::operator<
bool operator<(const TNodeI &NodeI) const
Definition: graph.h:986

TSnap
Main namespace for all the Snap global entities.
Definition: alg.h:1

TBPGraph::TBPGraph
TBPGraph(const TBPGraph &BPGraph)
!! Reserve(Nodes, Edges); }
Definition: graph.h:1056

TBPGraph::TEdgeI::TEdgeI
TEdgeI()
Definition: graph.h:1023

TBPGraph::TNode::GetDeg
int GetDeg() const
Definition: graph.h:954

TNGraph::LoadShM
static PNGraph LoadShM(TShMIn &ShMIn)
Static constructor that loads the graph from a shared memory stream and returns pointer to it...
Definition: graph.h:492

TBPGraph::TEdgeI::GetId
int GetId() const
Gets edge ID. Always returns -1 since only edges in multigraphs have explicit IDs.
Definition: graph.h:1033

TBPGraph::PNet
TPt< TBPGraph > PNet
Definition: graph.h:939

TUNGraph::TUNGraph
TUNGraph(const TUNGraph &Graph)
Definition: graph.h:165

TUNGraph::TNodeI::NodeHI
THashIter NodeHI
Definition: graph.h:71

TNGraph::AddNode
int AddNode(const TNodeI &NodeId)
Adds a node of ID NodeI.GetId() to the graph.
Definition: graph.h:517

TNGraph::TNode::GetOutDeg
int GetOutDeg() const
Definition: graph.h:364

TBPGraph::Reserve
void Reserve(const int &Nodes, const int &Edges)
Reserves memory for a biparite graph of Nodes nodes and Edges edges.
Definition: graph.cpp:790

TNEGraph::TEdge::GetSrcNId
int GetSrcNId() const
Definition: graph.h:701

TNGraph::GetNIdV
void GetNIdV(TIntV &NIdV) const
Gets a vector IDs of all nodes in the graph.
Definition: graph.cpp:376

TUNGraph::New
static PUNGraph New(const int &Nodes, const int &Edges)
Static constructor that returns a pointer to the graph and reserves enough memory for Nodes nodes and...
Definition: graph.h:176

TNGraph::TEdgeI::CurNode
TNodeI CurNode
Definition: graph.h:432

TNEGraph::TNodeI::IsInNId
bool IsInNId(const int &NId) const
Tests whether node with ID NId points to the current node.
Definition: graph.cpp:468

TNEGraph::DelNode
void DelNode(const int &NId)
Deletes node of ID NId from the graph.
Definition: graph.cpp:497

TNEGraph::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId, int EId=-1)
Adds an edge with ID EId between node IDs SrcNId and DstNId to the graph.
Definition: graph.cpp:516

TNGraph::BegNI
TNodeI BegNI() const
Returns an iterator referring to the first node in the graph.
Definition: graph.h:548

TNEGraph::IsOk
bool IsOk(const bool &ThrowExcept=true) const
Checks the graph data structure for internal consistency.
Definition: graph.cpp:586

TUNGraph::EndEI
TEdgeI EndEI() const
Returns an iterator referring to the past-the-end edge in the graph.
Definition: graph.h:280

TBPGraph::GetRNIdV
void GetRNIdV(TIntV &NIdV) const
Gets a vector IDs of all 'right' nodes in the bipartite graph.
Definition: graph.cpp:784

TUNGraph::TNode::TNode
TNode(const int &NId)
Definition: graph.h:43

TUNGraph::TNode::IsOutNId
bool IsOutNId(const int &NId) const
Definition: graph.h:60

TUNGraph::TEdgeI::operator==
bool operator==(const TEdgeI &EdgeI) const
Definition: graph.h:133

TNEGraph::TNode::TNode
TNode()
Definition: graph.h:675

TUNGraph::TNodeI::operator--
TNodeI & operator--(int)
Decrement iterator.
Definition: graph.h:81

TSnap::IsBipart::Val
Definition: gbase.h:38

TBPGraph::TEdgeI::operator++
TEdgeI & operator++(int)
Increment iterator.
Definition: graph.h:1028

TBPGraph::TNodeI::operator=
TNodeI & operator=(const TNodeI &NodeI)
Definition: graph.h:978

TBPGraph::New
static PBPGraph New(const int &Nodes, const int &Edges)
Static constructor that returns a pointer to the graph and reserves enough memory for Nodes nodes and...
Definition: graph.h:1065

TBPGraph::TNode::TNode
TNode(const TNode &Node)
Definition: graph.h:950

TNEGraph::Empty
bool Empty() const
Tests whether the graph is empty (has zero nodes).
Definition: graph.h:898

TBPGraph::TNodeI::operator==
bool operator==(const TNodeI &NodeI) const
Definition: graph.h:987

TBPGraph::GetNI
TNodeI GetNI(const int &NId) const
Returns an iterator referring to the node of ID NId in the graph.
Definition: graph.h:1103

TBPGraph::TNodeI::GetInDeg
int GetInDeg() const
Returns in-degree of the current node (returns same as value GetDeg() since the graph is undirected)...
Definition: graph.h:997

TUNGraph::GetSmallGraph
static PUNGraph GetSmallGraph()
Returns a small graph on 5 nodes and 5 edges.
Definition: graph.cpp:221

TRnd
Definition: dt.h:11

TNEGraph::operator=
TNEGraph & operator=(const TNEGraph &Graph)
Definition: graph.h:818

TUNGraph::TNodeI::THashIter
THash< TInt, TNode >::TIter THashIter
Definition: graph.h:70

TUNGraph::GetNode
TNode & GetNode(const int &NId)
Definition: graph.h:153

TNEGraph::TEdgeI::operator==
bool operator==(const TEdgeI &EdgeI) const
Definition: graph.h:779

TUNGraph::TNodeI::IsNbrNId
bool IsNbrNId(const int &NId) const
Tests whether node with ID NId is a neighbor of the current node.
Definition: graph.h:117

TNEGraph::TNode::GetNbrEId
int GetNbrEId(const int &EdgeN) const
Definition: graph.h:686

TUNGraph::TNode::LoadShM
void LoadShM(TShMIn &ShMIn)
Definition: graph.h:46

TNEGraph::TEdge::TEdge
TEdge(const int &EId, const int &SourceNId, const int &DestNId)
Definition: graph.h:696

TBPGraph::GetRndNId
int GetRndNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random node in the graph.
Definition: graph.cpp:754

TBPGraph::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: graph.h:1090

TNGraph::Dump
void Dump(FILE *OutF=stdout) const
Print the graph in a human readable form to an output stream OutF.
Definition: graph.cpp:437

TBPGraph::TNode::NodeTy
TNodeTy NodeTy
Definition: graph.h:946

TInt::Val
int Val
Definition: dt.h:1139

TNEGraph::TEdgeI::Graph
const TNEGraph * Graph
Definition: graph.h:770

TNGraph::New
static PNGraph New()
Static constructor that returns a pointer to the graph. Call: PNGraph Graph = TNGraph::New().
Definition: graph.h:481

TNGraph::GetNI
TNodeI GetNI(const int &NId) const
Returns an iterator referring to the node of ID NId in the graph.
Definition: graph.h:552

TInt::Save
void Save(TSOut &SOut) const
Definition: dt.h:1153

TNGraph::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId, const int &EId)
Adds an edge between node IDs SrcNId and DstNId to the graph, ignores EId (for compatibility with TNE...
Definition: graph.h:569

TNGraph::ReserveNIdInDeg
void ReserveNIdInDeg(const int &NId, const int &InDeg)
Reserves memory for node ID NId having InDeg in-edges.
Definition: graph.h:616

TBPGraph::TNodeI::HI
THashIter HI() const
Definition: graph.h:973

TNEGraph::BegEI
TEdgeI BegEI() const
Returns an iterator referring to the first edge in the graph.
Definition: graph.h:876

TNEGraph::TNEGraph
TNEGraph(const int &Nodes, const int &Edges)
Constructor that reserves enough memory for a graph of Nodes nodes and Edges edges.
Definition: graph.h:802

TBPGraph::AddNode
int AddNode(const TNodeI &NodeI)
Adds a node of ID NodeI.GetId() to the graph.
Definition: graph.h:1083

TBPGraph::bgsLeft
Definition: graph.h:940

TUNGraph::GetNIdV
void GetNIdV(TIntV &NIdV) const
Gets a vector IDs of all nodes in the graph.
Definition: graph.cpp:153

TNGraph::EndEI
TEdgeI EndEI() const
Returns an iterator referring to the past-the-end edge in the graph.
Definition: graph.h:596

TNEGraph::TNodeI::GetOutDeg
int GetOutDeg() const
Returns out-degree of the current node.
Definition: graph.h:730

TUNGraph::TEdgeI::GetDstNId
int GetDstNId() const
Returns the destination of the edge. Since the graph is undirected, this is the node with a greater I...
Definition: graph.h:139

TUNGraph::GetMxNId
int GetMxNId() const
Returns an ID that is larger than any node ID in the graph.
Definition: graph.h:243

TUNGraph::TNode::PackNIdV
void PackNIdV()
Definition: graph.h:62

TNGraph::TNodeI::IsInNId
bool IsInNId(const int &NId) const
Tests whether node with ID NId points to the current node.
Definition: graph.h:422

TBPGraph::IsLNode
bool IsLNode(const int &NId) const
Tests whether ID NId is a 'left' side node.
Definition: graph.h:1092

TNEGraph::TNEGraph
TNEGraph(TSIn &SIn)
Constructor for loading the graph from a (binary) stream SIn.
Definition: graph.h:805

TUNGraph::TUNGraph
TUNGraph(TSIn &SIn)
Constructor that loads the graph from a (binary) stream SIn.
Definition: graph.h:167

TNGraph::TEdgeI::operator=
TEdgeI & operator=(const TEdgeI &EdgeI)
Definition: graph.h:438

TNGraph::TLoadTNodeInitializer::TLoadTNodeInitializer
TLoadTNodeInitializer()
Definition: graph.h:459

TSnap::IsDirected
Tests (at compile time) if the graph is directed.
Definition: gbase.h:28

TNGraph::TNode::LoadShM
void LoadShM(TShMIn &ShMIn)
Definition: graph.h:374

TBPGraph::GetMxNId
int GetMxNId() const
Returns an ID that is larger than any node ID in the graph.
Definition: graph.h:1096

TBPGraph::TNode::GetNbrNId
int GetNbrNId(const int &NodeN) const
Definition: graph.h:959

THash::BegI
TIter BegI() const
Definition: hash.h:213

TNGraph::GetEdges
int GetEdges() const
Returns the number of edges in the graph.
Definition: graph.cpp:313

TBPGraph::TNodeI
Node iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:968

TUNGraph::AddNode
int AddNode(int NId=-1)
Adds a node of ID NId to the graph.
Definition: graph.cpp:8

TBPGraph::TEdgeI::GetDstNId
int GetDstNId() const
Gets destination ('right' side) of an edge. Since the graph is undirected this is the node with great...
Definition: graph.h:1037

TNGraph::NodeH
THash< TInt, TNode > NodeH
Definition: graph.h:455

TUNGraph::GetEdges
int GetEdges() const
Returns the number of edges in the graph.
Definition: graph.cpp:82

TBPGraph::TNodeTy
TNodeTy
Definition: graph.h:940

TNGraph::AddEdge
int AddEdge(const TEdgeI &EdgeI)
Adds an edge from EdgeI.GetSrcNId() to EdgeI.GetDstNId() to the graph.
Definition: graph.h:582

TVec::Len
TSizeTy Len() const
Returns the number of elements in the vector.
Definition: ds.h:575

TNEGraph::TNode::IsInEId
bool IsInEId(const int &EId) const
Definition: graph.h:687

TNEGraph::TEdge::TEdge
TEdge()
Definition: graph.h:695

TNEGraph::TNode::GetId
int GetId() const
Definition: graph.h:680

TNEGraph::PNet
TPt< TNEGraph > PNet
Definition: graph.h:668

TUNGraph::TNodeI::operator=
TNodeI & operator=(const TNodeI &NodeI)
Definition: graph.h:76

TNEGraph::TEdgeI::operator<
bool operator<(const TEdgeI &EdgeI) const
Definition: graph.h:778

TUNGraph::TNodeI
Node iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:68

TNEGraph::TEdgeI::GetId
int GetId() const
Gets edge ID.
Definition: graph.h:781

TBPGraph::EndNI
TNodeI EndNI() const
Returns an iterator referring to the past-the-end node in the graph.
Definition: graph.h:1101

TBPGraph::TEdgeI::operator==
bool operator==(const TEdgeI &EdgeI) const
Definition: graph.h:1031

TNGraph::AddEdgeUnchecked
int AddEdgeUnchecked(const int &SrcNId, const int &DstNId)
Adds an edge from node SrcNId to node DstNId to the graph.
Definition: graph.cpp:330

THash::Save
void Save(TSOut &SOut) const
Definition: hash.h:183

TBPGraph::BegNI
TNodeI BegNI() const
Returns an iterator referring to the first node in the graph.
Definition: graph.h:1099

TNEGraph::IsEdge
bool IsEdge(const int &SrcNId, const int &DstNId, const bool &IsDir=true) const
Tests whether an edge between node IDs SrcNId and DstNId exists in the graph.
Definition: graph.h:870

TNEGraph::TNodeI::operator--
TNodeI & operator--(int)
Decrement iterator.
Definition: graph.h:719

TNGraph::BegEI
TEdgeI BegEI() const
Returns an iterator referring to the first edge in the graph.
Definition: graph.h:594

TNEGraph::TNode::GetInDeg
int GetInDeg() const
Definition: graph.h:682

TNGraph::TEdgeI::CurEdge
int CurEdge
Definition: graph.h:433

TUNGraph::NEdges
TInt NEdges
Definition: graph.h:144

TNGraph::TEdgeI::operator++
TEdgeI & operator++(int)
Increment iterator.
Definition: graph.h:440

TNEGraph::TEdge::SrcNId
TInt SrcNId
Definition: graph.h:693

TNEGraph::TEdge::Save
void Save(TSOut &SOut) const
Definition: graph.h:699

TNGraph::IsOk
bool IsOk(const bool &ThrowExcept=true) const
Checks the graph data structure for internal consistency.
Definition: graph.cpp:391

TNEGraph::TNode::GetOutEId
int GetOutEId(const int &EdgeN) const
Definition: graph.h:685

TBPGraph::AddNode
int AddNode(int NId=-1, const bool &LeftNode=true)
Adds a node of ID NId to the graph.
Definition: graph.cpp:671

TNGraph::LoadGraphShM
void LoadGraphShM(TShMIn &ShMIn)
Definition: graph.h:465

TUNGraph::TNode::PackOutNIdV
void PackOutNIdV()
Definition: graph.h:61

TNEGraph
Directed multigraph.
Definition: graph.h:665

TNEGraph::EndEI
TEdgeI EndEI() const
Returns an iterator referring to the past-the-end edge in the graph.
Definition: graph.h:878

TNGraph::GetNodes
int GetNodes() const
Returns the number of nodes in the graph.
Definition: graph.h:503

TBPGraph::EndEI
TEdgeI EndEI() const
Returns an iterator referring to the past-the-end edge in the graph.
Definition: graph.h:1128

TNGraph::TNodeI::NodeHI
THashIter NodeHI
Definition: graph.h:386

TUNGraph::TNode::GetInDeg
int GetInDeg() const
Definition: graph.h:53

TVecPool< TInt >

TBPGraph::TNode::TNode
TNode()
Definition: graph.h:948

TNGraph::TNode::PackOutNIdV
void PackOutNIdV()
Definition: graph.h:371

TUNGraph::TNodeI::TNodeI
TNodeI()
Definition: graph.h:73

TNGraph::AddNode
int AddNode(int NId=-1)
Adds a node of ID NId to the graph.
Definition: graph.cpp:236

TNEGraph::CRef
TCRef CRef
Definition: graph.h:795

TShMIn
Definition: fl.h:384

TUNGraph::Dump
void Dump(FILE *OutF=stdout) const
Print the graph in a human readable form to an output stream OutF.
Definition: graph.cpp:207

TUNGraph::TLoadTNodeInitializer::TLoadTNodeInitializer
TLoadTNodeInitializer()
Definition: graph.h:149

TNEGraph::Load
static PNEGraph Load(TSIn &SIn)
Static constructor that loads the graph from a stream SIn and returns a pointer to it...
Definition: graph.h:815

TNGraph::TNGraph
TNGraph()
Definition: graph.h:472

TNEGraph::TEdgeI
Edge iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:766

THash::GetDat
const TDat & GetDat(const TKey &Key) const
Definition: hash.h:262

TNEGraph::Save
void Save(TSOut &SOut) const
Saves the graph to a (binary) stream SOut.
Definition: graph.h:807

TNGraph::TNode::TNode
TNode(const int &NId)
Definition: graph.h:357

TUNGraph::TEdgeI::GetSrcNId
int GetSrcNId() const
Returns the source of the edge. Since the graph is undirected, this is the node with a smaller ID of ...
Definition: graph.h:137

TUNGraph::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge EId exists in the graph (for compatibility with TNEANet), always returns false...
Definition: graph.h:276

TNGraph::TNodeI::operator--
TNodeI & operator--(int)
Decrement iterator.
Definition: graph.h:395

TBPGraph::CRef
TCRef CRef
Definition: graph.h:1045

TUNGraph::TEdgeI::EndNode
TNodeI EndNode
Definition: graph.h:123

TUNGraph::Save
void Save(TSOut &SOut) const
Saves the graph to a (binary) stream SOut.
Definition: graph.h:170

TNGraph::TNodeI::IsNbrNId
bool IsNbrNId(const int &NId) const
Tests whether node with ID NId is a neighbor of the current node.
Definition: graph.h:426

TUNGraph::GetNode
const TNode & GetNode(const int &NId) const
Definition: graph.h:154

THash::EndI
TIter EndI() const
Definition: hash.h:218

TNEGraph::TNet
TNEGraph TNet
Definition: graph.h:667

TNEGraph::TNodeI::NodeHI
THashIter NodeHI
Definition: graph.h:709

TUNGraph::SortNodeAdjV
void SortNodeAdjV()
Sorts the adjacency lists of each node.
Definition: graph.h:300

TInt::Rnd
static TRnd Rnd
Definition: dt.h:1146

TUNGraph::TNode::GetId
int GetId() const
Definition: graph.h:51

TUNGraph::TNode::IsInNId
bool IsInNId(const int &NId) const
Definition: graph.h:59

TBPGraph::GetRndLNId
int GetRndLNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random 'left' node in the graph.
Definition: graph.cpp:762

TNEGraph::TNodeI::operator++
TNodeI & operator++(int)
Increment iterator.
Definition: graph.h:717

TBPGraph::TBPGraph
TBPGraph(const int &Nodes, const int &Edges)
Constructor that reserves enough memory for a graph of Nodes (LeftNodes+RightNodes) nodes and Edges e...
Definition: graph.h:1055

TNEGraph::TNodeI::IsNbrEId
bool IsNbrEId(const int &EId) const
Tests whether the edge with ID EId is an in or out-edge of current node.
Definition: graph.h:762

TNEGraph::BegNI
TNodeI BegNI() const
Returns an iterator referring to the first node in the graph.
Definition: graph.h:840

TNGraph::TEdgeI::GetId
int GetId() const
Returns edge ID. Always returns -1 since only edges in multigraphs have explicit IDs.
Definition: graph.h:445

TNEGraph::DelNode
void DelNode(const TNode &NodeI)
Deletes node of ID NodeI.GetId() from the graph.
Definition: graph.h:836

TNEGraph::TEdgeI::EdgeHI
THashIter EdgeHI
Definition: graph.h:769

THash::LoadShM
void LoadShM(TShMIn &ShMIn)
Load THash from shared memory file. Copying/Deleting Keys is illegal.
Definition: hash.h:157

TUNGraph::GetNodes
int GetNodes() const
Returns the number of nodes in the graph.
Definition: graph.h:192

TBPGraph::TNodeI::IsInNId
bool IsInNId(const int &NId) const
Tests whether node with ID NId points to the current node.
Definition: graph.h:1010

TNEGraph::TNodeI::TNodeI
TNodeI(const THashIter &NodeHIter, const TNEGraph *GraphPt)
Definition: graph.h:713

TNEGraph::NodeH
THash< TInt, TNode > NodeH
Definition: graph.h:797

TNEGraph::TNodeI::GetInNId
int GetInNId(const int &EdgeN) const
Returns ID of EdgeN-th in-node (the node pointing to the current node).
Definition: graph.h:734

TNGraph::TNGraph
TNGraph(TSIn &SIn)
Constructor that loads the graph from a (binary) stream SIn.
Definition: graph.h:477

TNGraph::TEdgeI::EndNode
TNodeI EndNode
Definition: graph.h:432

TBPGraph::TNode::GetInNId
int GetInNId(const int &NodeN) const
Definition: graph.h:957

TNEGraph::TNode::GetOutDeg
int GetOutDeg() const
Definition: graph.h:683

TNGraph::TNode::Id
TInt Id
Definition: graph.h:353

TNGraph::GetNode
TNode & GetNode(const int &NId)
Definition: graph.h:463

TNEGraph::AddEdge
int AddEdge(const TEdgeI &EdgeI)
Adds an edge between EdgeI.GetSrcNId() and EdgeI.GetDstNId() to the graph.
Definition: graph.h:858

TSIn
Definition: fl.h:58

TVec::Save
void Save(TSOut &SOut) const
Definition: ds.h:954

TUNGraph::GetRndNId
int GetRndNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random node in the graph.
Definition: graph.h:289

TNEGraph::TEdgeI::operator++
TEdgeI & operator++(int)
Increment iterator.
Definition: graph.h:777

TBPGraph::TNode
Definition: graph.h:942

TBPGraph::TNodeI::GetId
int GetId() const
Returns ID of the current node.
Definition: graph.h:989

TBPGraph::TNode::GetOutNId
int GetOutNId(const int &NodeN) const
Definition: graph.h:958

TNGraph::TNode::GetInDeg
int GetInDeg() const
Definition: graph.h:363

TNEGraph::TEdgeI::GetDstNId
int GetDstNId() const
Gets destination of an edge.
Definition: graph.h:785

TNEGraph::EdgeH
THash< TInt, TEdge > EdgeH
Definition: graph.h:798

TNEGraph::TEdge::GetDstNId
int GetDstNId() const
Definition: graph.h:702

TBPGraph::GetLNodes
int GetLNodes() const
Returns the number of nodes on the 'left' side of the biparite graph.
Definition: graph.h:1076

TBPGraph::TNodeI::TNodeI
TNodeI()
Definition: graph.h:975

TUNGraph::TEdgeI::TEdgeI
TEdgeI(const TEdgeI &EdgeI)
Definition: graph.h:128

TUNGraph::TEdgeI::operator<
bool operator<(const TEdgeI &EdgeI) const
Definition: graph.h:132

TBPGraph::TEdgeI::TEdgeI
TEdgeI(const TNodeI &NodeI, const TNodeI &EndNodeI, const int &EdgeN=0)
Definition: graph.h:1024

TBPGraph::Load
static PBPGraph Load(TSIn &SIn)
Static constructor that loads the graph from a stream SIn and returns a pointer to it...
Definition: graph.h:1067

TUNGraph::CRef
TCRef CRef
Definition: graph.h:143

TNGraph::DelNode
void DelNode(const int &NId)
Deletes node of ID NId from the graph.
Definition: graph.cpp:294

TNEGraph::TNodeI::GetOutEId
int GetOutEId(const int &EdgeN) const
Returns ID of EdgeN-th out-edge.
Definition: graph.h:754

TNGraph::SortNodeAdjV
void SortNodeAdjV()
Sorts the adjacency lists of each node.
Definition: graph.h:620

TBPGraph::TNodeI::GetNbrNId
int GetNbrNId(const int &NodeN) const
Returns ID of NodeN-th neighboring node.
Definition: graph.h:1008

TUNGraph::TNodeI::GetDeg
int GetDeg() const
Returns degree of the current node.
Definition: graph.h:90

TBPGraph::Clr
void Clr()
Deletes all nodes and edges from the bipartite graph.
Definition: graph.h:1153

TNEGraph::EndNI
TNodeI EndNI() const
Returns an iterator referring to the past-the-end node in the graph.
Definition: graph.h:842

TUNGraph::GetEI
TEdgeI GetEI(const int &EId) const
Not supported/implemented!

TBPGraph::TNode::TNode
TNode(const int &NId)
Definition: graph.h:949

TNEGraph::TNode::GetInEId
int GetInEId(const int &EdgeN) const
Definition: graph.h:684

TNEGraph::GetNI
TNodeI GetNI(const int &NId) const
Returns an iterator referring to the node of ID NId in the graph.
Definition: graph.h:844

TBPGraph::bgsRight
Definition: graph.h:940

TBPGraph::TNodeI::GetOutDeg
int GetOutDeg() const
Returns out-degree of the current node (returns same as value GetDeg() since the graph is undirected)...
Definition: graph.h:999

TNGraph::TNode::GetId
int GetId() const
Definition: graph.h:361

TNEGraph::TNodeI::GetNbrNId
int GetNbrNId(const int &EdgeN) const
Returns ID of EdgeN-th neighboring node.
Definition: graph.h:742

TNEGraph::GetNIdV
void GetNIdV(TIntV &NIdV) const
Gets a vector IDs of all nodes in the graph.
Definition: graph.cpp:564

TNEGraph::GetEI
TEdgeI GetEI(const int &SrcNId, const int &DstNId) const
Returns an iterator referring to edge (SrcNId, DstNId) in the graph.
Definition: graph.h:882

TNEGraph::TNode::Id
TInt Id
Definition: graph.h:672

TNEGraph::GetNodes
int GetNodes() const
Returns the number of nodes in the graph.
Definition: graph.h:822

TUNGraph::LoadShM
static PUNGraph LoadShM(TShMIn &ShMIn)
Static constructor that loads the graph from shared memory.
Definition: graph.h:182

TUNGraph::TNodeI::operator++
TNodeI & operator++(int)
Increment iterator.
Definition: graph.h:79

TBPGraph::TNodeI::LeftHI
THashIter LeftHI
Definition: graph.h:971

TNGraph::TNodeI::SortNIdV
void SortNIdV()
Sorts the adjacency lists of the current node.
Definition: graph.h:408

TUNGraph::TNodeI::GetOutDeg
int GetOutDeg() const
Returns out-degree of the current node (returns same as value GetDeg() since the graph is undirected)...
Definition: graph.h:94

TBPGraph::Empty
bool Empty() const
Tests whether the bipartite graph is empty (has zero nodes).
Definition: graph.h:1151

TNGraph::TNode::PackNIdV
void PackNIdV()
Definition: graph.h:372

PNEGraph
TPt< TNEGraph > PNEGraph
Pointer to a directed multigraph (TNEGraph)
Definition: graph.h:21

TNEGraph::GetEdge
TEdge & GetEdge(const int &EId)
Definition: graph.h:792

TUNGraph
Undirected graph.
Definition: graph.h:32

TBPGraph::TEdgeI::GetLNId
int GetLNId() const
Gets the ID of the node on the 'left' side of the edge.
Definition: graph.h:1039

TNGraph::TNodeI::THashIter
THash< TInt, TNode >::TIter THashIter
Definition: graph.h:385

TNEGraph::TNodeI::IsOutNId
bool IsOutNId(const int &NId) const
Tests whether the current node points to node with ID NId.
Definition: graph.cpp:477

TBPGraph::EndRNI
TNodeI EndRNI() const
Returns an iterator referring to the past-the-end 'right' node in the graph.
Definition: graph.h:1111

TNGraph::TNodeI::operator++
TNodeI & operator++(int)
Increment iterator.
Definition: graph.h:393

TNGraph::TNodeI::TNodeI
TNodeI()
Definition: graph.h:388

TVec::Sort
void Sort(const bool &Asc=true)
Sorts the elements of the vector.
Definition: ds.h:1318

TBPGraph::TNode::IsOutNId
bool IsOutNId(const int &NId) const
Definition: graph.h:962

THash::Gen
void Gen(const int &ExpectVals)
Definition: hash.h:222

TNGraph::TEdgeI
Edge iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:430

TNEGraph::TEdge::Id
TInt Id
Definition: graph.h:693

TBPGraph::GetEdges
int GetEdges() const
Returns the number of edges in the graph.
Definition: graph.cpp:698

TUNGraph::MxNId
TInt MxNId
Definition: graph.h:144

TBPGraph::TNodeI::TNodeI
TNodeI(const THashIter &LeftHIter, const THashIter &RightHIter)
Definition: graph.h:976

TNGraph::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId)
Adds an edge from node SrcNId to node DstNId to the graph.
Definition: graph.cpp:321

TNEGraph::GetSmallGraph
static PNEGraph GetSmallGraph()
Returns a small multigraph on 5 nodes and 6 edges.
Definition: graph.cpp:660

TBPGraph::GetNodes
int GetNodes() const
Returns the total number of nodes in the graph.
Definition: graph.h:1074

TBPGraph::TNode::IsInNId
bool IsInNId(const int &NId) const
Definition: graph.h:961

TNGraph::Load
static PNGraph Load(TSIn &SIn)
Static constructor that loads the graph from a stream SIn and returns a pointer to it...
Definition: graph.h:487

TNGraphMtx
Definition: gsvd.h:5

TNEGraph::TEdgeI::TEdgeI
TEdgeI(const THashIter &EdgeHIter, const TNEGraph *GraphPt)
Definition: graph.h:773

TUNGraph::DelNode
void DelNode(const TNode &NodeI)
Deletes node of ID NodeI.GetId() from the graph.
Definition: graph.h:233

TNGraph::DelEdge
void DelEdge(const int &SrcNId, const int &DstNId, const bool &IsDir=true)
Deletes an edge from node IDs SrcNId to DstNId from the graph.
Definition: graph.cpp:345

TNGraph::IsEdge
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 graph.
Definition: graph.cpp:363

TUNGraph::Reserve
void Reserve(const int &Nodes, const int &Edges)
Reserves memory for a graph of Nodes nodes and Edges edges.
Definition: graph.h:302

TNGraph::TNGraph
TNGraph(const int &Nodes, const int &Edges)
Constructor that reserves enough memory for a graph of Nodes nodes and Edges edges.
Definition: graph.h:474

TUNGraph::Empty
bool Empty() const
Tests whether the graph is empty (has zero nodes).
Definition: graph.h:296

TNGraph::GetRndNId
int GetRndNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random node in the graph.
Definition: graph.h:603

TBPGraph::BegLNI
TNodeI BegLNI() const
Returns an iterator referring to the first 'left' node in the graph.
Definition: graph.h:1105

TNEGraph::TNodeI::GetInEId
int GetInEId(const int &EdgeN) const
Returns ID of EdgeN-th in-edge.
Definition: graph.h:752

TNEGraph::TNode::TNode
TNode(TSIn &SIn)
Definition: graph.h:678

TNGraph::TNodeI::IsOutNId
bool IsOutNId(const int &NId) const
Tests whether the current node points to node with ID NId.
Definition: graph.h:424

TNGraph::TNode::TNode
TNode(TSIn &SIn)
Definition: graph.h:359

TBPGraph::GetRNodes
int GetRNodes() const
Returns the number of nodes on the 'right' side of the biparite graph.
Definition: graph.h:1078

TUNGraph::GetNI
TNodeI GetNI(const int &NId) const
Returns an iterator referring to the node of ID NId in the graph.
Definition: graph.h:241

TNEGraph::HasFlag
bool HasFlag(const TGraphFlag &Flag) const
Allows for run-time checking the type of the graph (see the TGraphFlag for flags).
Definition: graph.cpp:464

TNEGraph::TNodeI::THashIter
THash< TInt, TNode >::TIter THashIter
Definition: graph.h:708

TSnap::IsMultiGraph
Tests (at compile time) if the graph is a multigraph with multiple edges between the same nodes...
Definition: gbase.h:30

TNGraph::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: graph.h:546

TNEGraph::TEdgeI::TEdgeI
TEdgeI()
Definition: graph.h:772

TUNGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:75

TNEGraph::TNode::TNode
TNode(const TNode &Node)
Definition: graph.h:677

TNEGraph::TNodeI::GetOutNId
int GetOutNId(const int &EdgeN) const
Returns ID of EdgeN-th out-node (the node the current node points to).
Definition: graph.h:738

TNEGraph::TEdge::DstNId
TInt DstNId
Definition: graph.h:693

TNGraph::TNode
Definition: graph.h:351

TUNGraph::TLoadTNodeInitializer::operator()
void operator()(TNode *Node, TShMIn &ShMIn)
Definition: graph.h:150

TBPGraph::IsEdge
bool IsEdge(const int &LeftNId, const int &RightNId) const
Tests whether an edge between node IDs LeftNId and RightNId exists in the graph.
Definition: graph.cpp:735

TBPGraph::TEdgeI::operator<
bool operator<(const TEdgeI &EdgeI) const
Definition: graph.h:1030

TUNGraph::TNode::NIdV
TIntV NIdV
Definition: graph.h:40

TUNGraph::AddEdge
int AddEdge(const TEdgeI &EdgeI)
Adds an edge between EdgeI.GetSrcNId() and EdgeI.GetDstNId() to the graph.
Definition: graph.h:267

TBPGraph::MxNId
TInt MxNId
Definition: graph.h:1046

TUNGraph::BegEI
TEdgeI BegEI() const
Returns an iterator referring to the first edge in the graph.
Definition: graph.h:278

TBPGraph::TNode::PackOutNIdV
void PackOutNIdV()
Definition: graph.h:963

TSnap::IsDirected::Val
Definition: gbase.h:28

TBPGraph::GetLNIdV
void GetLNIdV(TIntV &NIdV) const
Gets a vector IDs of all 'left' nodes in the bipartite graph.
Definition: graph.cpp:778

TUNGraph::New
static PUNGraph New()
Static constructor that returns a pointer to the graph. Call: PUNGraph Graph = TUNGraph::New().
Definition: graph.h:172

TNGraph::TEdgeI::TEdgeI
TEdgeI(const TNodeI &NodeI, const TNodeI &EndNodeI, const int &EdgeN=0)
Definition: graph.h:436

TUNGraph::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId, const int &EId)
Adds an edge between node IDs SrcNId and DstNId to the graph, ignores EId (for compatibility with TNE...
Definition: graph.h:254

PNGraph
TPt< TNGraph > PNGraph
Pointer to a directed graph (TNGraph)
Definition: graph.h:16

TUNGraph::TEdgeI::CurNode
TNodeI CurNode
Definition: graph.h:123

TNEGraph::TNodeI::operator<
bool operator<(const TNodeI &NodeI) const
Definition: graph.h:721

TBPGraph::TNet
TBPGraph TNet
Definition: graph.h:938

TNGraph::TNode::GetOutNId
int GetOutNId(const int &NodeN) const
Definition: graph.h:366

TBPGraph::operator=
TBPGraph & operator=(const TBPGraph &BPGraph)
Definition: graph.h:1070

TNEGraph::AddNode
int AddNode(int NId=-1)
Adds a node of ID NId to the graph.
Definition: graph.cpp:486

TNEGraph::AddNode
int AddNode(const TNodeI &NodeId)
Adds a node of ID NodeI.GetId() to the graph.
Definition: graph.h:830

TUNGraph::DelEdge
void DelEdge(const int &SrcNId, const int &DstNId)
Deletes an edge between node IDs SrcNId and DstNId from the graph.
Definition: graph.cpp:124

TBPGraph::BegRNI
TNodeI BegRNI() const
Returns an iterator referring to the first 'right' node in the graph.
Definition: graph.h:1109

TUNGraph::TNode::GetOutNId
int GetOutNId(const int &NodeN) const
Definition: graph.h:56

TUNGraph::AddNodeUnchecked
int AddNodeUnchecked(int NId=-1)
Adds a node of ID NId to the network, noop if the node already exists.
Definition: graph.cpp:20

TNEGraph::TNode::OutEIdV
TIntV OutEIdV
Definition: graph.h:673

TNEGraph::Dump
void Dump(FILE *OutF=stdout) const
Print the graph in a human readable form to an output stream OutF.
Definition: graph.cpp:639

TUNGraph::GetRndNI
TNodeI GetRndNI(TRnd &Rnd=TInt::Rnd)
Returns an interator referring to a random node in the graph.
Definition: graph.h:291

TBPGraph::TNode::Save
void Save(TSOut &SOut) const
Definition: graph.h:952

TUNGraph::TNode::Save
void Save(TSOut &SOut) const
Definition: graph.h:50

TUNGraph::TNet
TUNGraph TNet
Definition: graph.h:34

TBPGraph::EndLNI
TNodeI EndLNI() const
Returns an iterator referring to the past-the-end 'left' node in the graph.
Definition: graph.h:1107

TUNGraph::TNode::SortNIdV
void SortNIdV()
Definition: graph.h:63

TBPGraph::TEdgeI::GetRNId
int GetRNId() const
Gets the ID of the node on the 'right' side of the edge.
Definition: graph.h:1041

TNGraph::GetRndNI
TNodeI GetRndNI(TRnd &Rnd=TInt::Rnd)
Returns an interator referring to a random node in the graph.
Definition: graph.h:605

TNGraph::TNodeI::operator=
TNodeI & operator=(const TNodeI &NodeI)
Definition: graph.h:391

TNEGraph::TNodeI::operator==
bool operator==(const TNodeI &NodeI) const
Definition: graph.h:722

TNGraph::TNodeI::GetDeg
int GetDeg() const
Returns degree of the current node, the sum of in-degree and out-degree.
Definition: graph.h:402

TUNGraph::TNodeI::operator==
bool operator==(const TNodeI &NodeI) const
Definition: graph.h:85

TSOut
Definition: fl.h:128

TNGraph::TNGraph
TNGraph(const TNGraph &Graph)
Definition: graph.h:475

TBPGraph::TNodeI::THashIter
THash< TInt, TNode >::TIter THashIter
Definition: graph.h:970

TBPGraph::TNode::NIdV
TIntV NIdV
Definition: graph.h:945

TBPGraph::bgsUndef
Definition: graph.h:940

TNEGraph::TNode::GetDeg
int GetDeg() const
Definition: graph.h:681

TBPGraph::TNodeI::IsNbrNId
bool IsNbrNId(const int &NId) const
Tests whether node with ID NId is a neighbor of the current node.
Definition: graph.h:1014

TNGraph::TLoadTNodeInitializer::operator()
void operator()(TNode *Node, TShMIn &ShMIn)
Definition: graph.h:460

TVec::SearchBin
TSizeTy SearchBin(const TVal &Val) const
Returns the position of an element with value Val.
Definition: ds.h:1519

TNGraph::Defrag
void Defrag(const bool &OnlyNodeLinks=false)
Defragments the graph.
Definition: graph.cpp:382

TUNGraph::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId)
Adds an edge between node IDs SrcNId and DstNId to the graph.
Definition: graph.cpp:92

TNGraph::TNodeI::operator<
bool operator<(const TNodeI &NodeI) const
Definition: graph.h:397

TBPGraph::TNodeI::GetDeg
int GetDeg() const
Returns degree of the current node.
Definition: graph.h:995

TNGraph::Clr
void Clr()
Deletes all nodes and edges from the graph.
Definition: graph.h:612

TUNGraph::TUNGraph
TUNGraph()
Definition: graph.h:162

TInt
Definition: dt.h:1137

TUNGraph::TNode::Id
TInt Id
Definition: graph.h:39

TNGraph::GetMxNId
int GetMxNId() const
Returns an ID that is larger than any node ID in the graph.
Definition: graph.h:556

TBPGraph::TNode::IsNbrNId
bool IsNbrNId(const int &NId) const
Definition: graph.h:960

TNEGraph::TNEGraph
TNEGraph(const TNEGraph &Graph)
Definition: graph.h:803

TNEGraph::GetNode
TNode & GetNode(const int &NId)
Definition: graph.h:790

TUNGraph::Load
static PUNGraph Load(TSIn &SIn)
Static constructor that loads the graph from a stream SIn and returns a pointer to it...
Definition: graph.h:178

TNEGraph::New
static PNEGraph New()
Static constructor that returns a pointer to the graph. Call: PNEGraph Graph = TNEGraph::New().
Definition: graph.h:809

TNGraph::Save
void Save(TSOut &SOut) const
Saves the graph to a (binary) stream SOut.
Definition: graph.h:479

TNEGraph::TNode::Save
void Save(TSOut &SOut) const
Definition: graph.h:679

TBPGraph::AddEdge
int AddEdge(const int &LeftNId, const int &RightNId)
Adds an edge between a node LeftNId on the left and a node RightNId on the right side of the bipartit...
Definition: graph.cpp:705

TNGraph::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge EId exists in the graph (for compatibility with TNEANet), always returns false...
Definition: graph.h:592

TNEGraph::TNodeI::TNodeI
TNodeI()
Definition: graph.h:712

TBPGraph::DelEdge
void DelEdge(const int &LeftNId, const int &RightNId)
Deletes an edge between a node LeftNId on the left and a node RightNId on the right side of the bipar...
Definition: graph.cpp:719

TUNGraph::TLoadTNodeInitializer
Definition: graph.h:147

TBPGraph::TNodeI::RightHI
THashIter RightHI
Definition: graph.h:971

TBPGraph::TEdgeI::GetSrcNId
int GetSrcNId() const
Gets the source ('left' side) of an edge. Since the graph is undirected this is the node with smaller...
Definition: graph.h:1035

TNEGraph::TEdge::TEdge
TEdge(const TEdge &Edge)
Definition: graph.h:697

TNGraph
Directed graph.
Definition: graph.h:346

TUNGraph::TNode::IsNbrNId
bool IsNbrNId(const int &NId) const
Definition: graph.h:58

TVec::LoadShM
void LoadShM(TShMIn &ShMIn)
Constructs the vector from a shared memory input.
Definition: ds.h:932

TUNGraph::TNode::GetNbrNId
int GetNbrNId(const int &NodeN) const
Definition: graph.h:57

TNEGraph::GetEI
TEdgeI GetEI(const int &EId) const
Returns an iterator referring to edge with edge ID EId.
Definition: graph.h:880

TBPGraph::DelNode
void DelNode(const int &NId)
Deletes node of ID NId from the graph.
Definition: graph.cpp:682

TNGraph::TNode::TNode
TNode(const TNode &Node)
Definition: graph.h:358

TBPGraph::TEdgeI::operator=
TEdgeI & operator=(const TEdgeI &EdgeI)
Definition: graph.h:1026

TNEGraph::IsEdge
bool IsEdge(const int &EId) const
Tests whether an edge with edge ID EId exists in the graph.
Definition: graph.h:868

TNGraph::EndNI
TNodeI EndNI() const
Returns an iterator referring to the past-the-end node in the graph.
Definition: graph.h:550

TNGraph::TNodeI::GetId
int GetId() const
Returns ID of the current node.
Definition: graph.h:400

TBPGraph::TBPGraph
TBPGraph()
Definition: graph.h:1053

TNGraph::GetSmallGraph
static PNGraph GetSmallGraph()
Returns a small graph on 5 nodes and 6 edges.
Definition: graph.cpp:454

TNEGraph::TNode::TNode
TNode(const int &NId)
Definition: graph.h:676

TUNGraph::TNodeI::GetOutNId
int GetOutNId(const int &NodeN) const
Returns ID of NodeN-th out-node (the node the current node points to).
Definition: graph.h:106

TBPGraph::GetRndRNId
int GetRndRNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random 'right' node in the graph.
Definition: graph.cpp:766

TNEGraph::GetNode
const TNode & GetNode(const int &NId) const
Definition: graph.h:791

TUNGraph::TEdgeI::GetId
int GetId() const
Returns edge ID. Always returns -1 since only edges in multigraphs have explicit IDs.
Definition: graph.h:135

TNEGraph::Reserve
void Reserve(const int &Nodes, const int &Edges)
Reserves memory for a graph of Nodes nodes and Edges edges.
Definition: graph.h:902

TNGraph::TNodeI::GetOutDeg
int GetOutDeg() const
Returns out-degree of the current node.
Definition: graph.h:406

TBPGraph
Bipartite graph.
Definition: graph.h:936

TNEGraph::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: graph.h:874

TNEGraph::TEdgeI::GetSrcNId
int GetSrcNId() const
Gets the source of an edge.
Definition: graph.h:783

TUNGraph::AddEdge2
int AddEdge2(const int &SrcNId, const int &DstNId)
Adds an edge between node IDs SrcNId and DstNId to the graph. If nodes do not exists, create them.
Definition: graph.cpp:112

TNEGraph::TNodeI::operator=
TNodeI & operator=(const TNodeI &NodeI)
Definition: graph.h:715

TUNGraph::NodeH
THash< TInt, TNode > NodeH
Definition: graph.h:145

TNEGraph::TEdge::TEdge
TEdge(TSIn &SIn)
Definition: graph.h:698

TUNGraph::TNode::TNode
TNode(const TNode &Node)
Definition: graph.h:44

TNGraph::TLoadTNodeInitializer
Definition: graph.h:457

TNEGraph::TNode::IsOutEId
bool IsOutEId(const int &EId) const
Definition: graph.h:688

TNGraph::New
static PNGraph New(const int &Nodes, const int &Edges)
Static constructor that returns a pointer to the graph and reserves enough memory for Nodes nodes and...
Definition: graph.h:485

TNEGraph::GetEIdV
void GetEIdV(TIntV &EIdV) const
Gets a vector IDs of all edges in the graph.
Definition: graph.cpp:570

TBPGraph::TNode::TNode
TNode(TSIn &SIn)
Definition: graph.h:951

TVec::Pack
void Pack()
Reduces vector capacity (frees memory) to match its size.
Definition: ds.h:1057

TBPGraph::TNode::GetId
int GetId() const
Definition: graph.h:953

TNEGraph::GetRndEId
int GetRndEId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random edge in the graph.
Definition: graph.h:889

TGraphFlag
enum TGraphFlag_ TGraphFlag
Graph Flags, used for quick testing of graph types.

TBPGraph::IsRNode
bool IsRNode(const int &NId) const
Tests whether ID NId is a 'right' side node.
Definition: graph.h:1094

TBPGraph::TNodeI::IsRight
bool IsRight() const
Tests whether the node is right hand side node.
Definition: graph.h:993

TNGraph::CRef
TCRef CRef
Definition: graph.h:453

TBPGraph::RightH
THash< TInt, TNode > RightH
Definition: graph.h:1048

THash
Definition: hash.h:97

TBPGraph::bgsBoth
Definition: graph.h:940

TNGraph::TNodeI::TNodeI
TNodeI(const THashIter &NodeHIter)
Definition: graph.h:389

TNEGraph::New
static PNEGraph New(const int &Nodes, const int &Edges)
Static constructor that returns a pointer to the graph and reserves enough memory for Nodes nodes and...
Definition: graph.h:813

TNGraph::PNet
TPt< TNGraph > PNet
Definition: graph.h:349

TNEGraph::TNodeI::GetNbrEId
int GetNbrEId(const int &EdgeN) const
Returns ID of EdgeN-th in or out-edge.
Definition: graph.h:756

TNEGraph::GetEdges
int GetEdges() const
Returns the number of edges in the graph.
Definition: graph.h:849

TUNGraph::TNodeI::GetInDeg
int GetInDeg() const
Returns in-degree of the current node (returns same as value GetDeg() since the graph is undirected)...
Definition: graph.h:92

TNGraph::TNodeI
Node iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:383

TUNGraph::TNode
Definition: graph.h:37

TUNGraph::Defrag
void Defrag(const bool &OnlyNodeLinks=false)
Defragments the graph.
Definition: graph.cpp:160

TNEGraph::TEdge
Definition: graph.h:691

TNEGraph::GetEdge
const TEdge & GetEdge(const int &EId) const
Definition: graph.h:793

TUNGraph::EndNI
TNodeI EndNI() const
Returns an iterator referring to the past-the-end node in the graph.
Definition: graph.h:239

TBPGraph::TNode::GetOutDeg
int GetOutDeg() const
Definition: graph.h:956

TNEGraph::TNodeI::Graph
const TNEGraph * Graph
Definition: graph.h:710

TNGraph::TNode::InNIdV
TIntV InNIdV
Definition: graph.h:354

TBPGraph::TNode::Id
TInt Id
Definition: graph.h:944

TBPGraph::TNodeI::IsOutNId
bool IsOutNId(const int &NId) const
Tests whether the current node points to node with ID NId.
Definition: graph.h:1012

TUNGraph::TNode::TNode
TNode()
Definition: graph.h:42

TUNGraph::PNet
TPt< TUNGraph > PNet
Definition: graph.h:35

TNGraph::TNode::TNode
TNode()
Definition: graph.h:356

TNEGraph::GetRndNId
int GetRndNId(TRnd &Rnd=TInt::Rnd)
Returns an ID of a random node in the graph.
Definition: graph.h:885

TNGraph::Reserve
void Reserve(const int &Nodes, const int &Edges)
Reserves memory for a graph of Nodes nodes and Edges edges.
Definition: graph.h:614

TBPGraph::New
static PBPGraph New()
Static constructor that returns a pointer to the graph. Call: PBPGraph BPGraph = TBPGraph::New();.
Definition: graph.h:1062

TUNGraph::TNodeI::GetNbrNId
int GetNbrNId(const int &NodeN) const
Returns ID of NodeN-th neighboring node.
Definition: graph.h:111

THash::Clr
void Clr(const bool &DoDel=true, const int &NoDelLim=-1, const bool &ResetDat=true)
Definition: hash.h:361

TBPGraph::LeftH
THash< TInt, TNode > LeftH
Definition: graph.h:1047

TUNGraph::TNode::TNode
TNode(TSIn &SIn)
Definition: graph.h:45

TNEGraph::MxNId
TInt MxNId
Definition: graph.h:796

TUNGraph::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: graph.h:235

TNGraph::MxNId
TInt MxNId
Definition: graph.h:454

TPt< TUNGraph >

TBPGraph::TNodeI::GetOutNId
int GetOutNId(const int &NodeN) const
Returns ID of NodeN-th out-node (the node the current node points to).
Definition: graph.h:1005

PBPGraph
TPt< TBPGraph > PBPGraph
Pointer to a bipartitegraph graph (TBPGraph)
Definition: graph.h:11

TUNGraph::HasFlag
bool HasFlag(const TGraphFlag &Flag) const
Allows for run-time checking the type of the graph (see the TGraphFlag for flags).
Definition: graph.cpp:3

TNEGraph::GetRndNI
TNodeI GetRndNI(TRnd &Rnd=TInt::Rnd)
Returns an interator referring to a random node in the graph.
Definition: graph.h:887

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

TNGraph::TNodeI::operator==
bool operator==(const TNodeI &NodeI) const
Definition: graph.h:398

TNEGraph::Clr
void Clr()
Deletes all nodes and edges from the graph.
Definition: graph.h:900

TBPGraph::TEdgeI::CurNode
TNodeI CurNode
Definition: graph.h:1020

TBPGraph::GetNIdV
void GetNIdV(TIntV &NIdV) const
Gets a vector IDs of all nodes in the bipartite graph.
Definition: graph.cpp:770

TUNGraph::Clr
void Clr()
Deletes all nodes and edges from the graph.
Definition: graph.h:298

TBPGraph::TNodeI::operator++
TNodeI & operator++(int)
Increment iterator.
Definition: graph.h:980

TUNGraph::IsOk
bool IsOk(const bool &ThrowExcept=true) const
Checks the graph data structure for internal consistency.
Definition: graph.cpp:170

TVec::Reserve
void Reserve(const TSizeTy &_MxVals)
Reserves enough memory for the vector to store _MxVals elements.
Definition: ds.h:543

TNEGraph::GetRndEI
TEdgeI GetRndEI(TRnd &Rnd=TInt::Rnd)
Returns an interator referring to a random edge in the graph.
Definition: graph.h:891

TNGraph::TNode::OutNIdV
TIntV OutNIdV
Definition: graph.h:354

TUNGraph::TNode::GetOutDeg
int GetOutDeg() const
Definition: graph.h:54

TNGraph::GetNode
const TNode & GetNode(const int &NId) const
Definition: graph.h:464

TNGraph::AddNodeUnchecked
int AddNodeUnchecked(int NId=-1)
Adds a node of ID NId to the network, noop if the node already exists.
Definition: graph.cpp:247

TBPGraph::HasFlag
bool HasFlag(const TGraphFlag &Flag) const
Allows for run-time checking the type of the graph (see the TGraphFlag for flags).

TUNGraph::TNodeI::SortNIdV
void SortNIdV()
Sorts the adjacency lists of the current node.
Definition: graph.h:96

TNEGraph::Defrag
void Defrag(const bool &OnlyNodeLinks=false)
Defragments the graph.
Definition: graph.cpp:577

TNGraph::TNode::SortNIdV
void SortNIdV()
Definition: graph.h:373

TBPGraph::BegEI
TEdgeI BegEI() const
Returns an iterator referring to the first edge in the graph.
Definition: graph.h:1126

TBPGraph::TEdgeI::EndNode
TNodeI EndNode
Definition: graph.h:1020

TNGraph::TNodeI::GetInDeg
int GetInDeg() const
Returns in-degree of the current node.
Definition: graph.h:404

TNGraph::DelNode
void DelNode(const TNode &NodeI)
Deletes node of ID NodeI.GetId() from the graph.
Definition: graph.h:544

TBPGraph::Dump
void Dump(FILE *OutF=stdout) const
Print the biparite graph in a human readable form to an output stream OutF.
Definition: graph.cpp:845

TBPGraph::DelNode
void DelNode(const TNode &NodeI)
Deletes node of ID NodeI.GetId() from the graph.
Definition: graph.h:1088

TNGraph::TEdgeI::GetSrcNId
int GetSrcNId() const
Returns the source node of the edge.
Definition: graph.h:447

TNEGraph::TNodeI::GetId
int GetId() const
Returns ID of the current node.
Definition: graph.h:724

TBPGraph::Defrag
void Defrag(const bool &OnlyNodeLinks=false)
Defragments the biparite graph.
Definition: graph.cpp:794

TUNGraph::TNodeI::GetId
int GetId() const
Returns ID of the current node.
Definition: graph.h:88

TUNGraph::IsEdge
bool IsEdge(const int &SrcNId, const int &DstNId) const
Tests whether an edge between node IDs SrcNId and DstNId exists in the graph.
Definition: graph.cpp:137

TBPGraph::TEdgeI::TEdgeI
TEdgeI(const TEdgeI &EdgeI)
Definition: graph.h:1025

THash::IsKey
bool IsKey(const TKey &Key) const
Definition: hash.h:258

TNGraph::TNodeI::GetInNId
int GetInNId(const int &NodeN) const
Returns ID of NodeN-th in-node (the node pointing to the current node).
Definition: graph.h:412

TBPGraph::TNode::PackNIdV
void PackNIdV()
Definition: graph.h:964

TUNGraph::TNodeI::IsOutNId
bool IsOutNId(const int &NId) const
Tests whether the current node points to node with ID NId.
Definition: graph.h:115

TNEGraph::DelEdge
void DelEdge(const int &EId)
Deletes an edge with edge ID EId from the graph.
Definition: graph.cpp:527

TNGraph::GetEI
TEdgeI GetEI(const int &EId) const
Not supported/implemented!

TUNGraph::TNode::GetInNId
int GetInNId(const int &NodeN) const
Definition: graph.h:55

TNEGraph::TNodeI::IsOutEId
bool IsOutEId(const int &EId) const
Tests whether the edge with ID EId is an out-edge of current node.
Definition: graph.h:760

TUNGraph::BegNI
TNodeI BegNI() const
Returns an iterator referring to the first node in the graph.
Definition: graph.h:237

TNGraph::TNode::GetInNId
int GetInNId(const int &NodeN) const
Definition: graph.h:365

TNGraph::TNode::GetDeg
int GetDeg() const
Definition: graph.h:362

TNEGraph::TNode
Definition: graph.h:670

TUNGraph::TNode::GetDeg
int GetDeg() const
Definition: graph.h:52

TNGraph::TEdgeI::operator<
bool operator<(const TEdgeI &EdgeI) const
Definition: graph.h:442

TUNGraph::ReserveNIdDeg
void ReserveNIdDeg(const int &NId, const int &Deg)
Reserves memory for node ID NId having Deg edges.
Definition: graph.h:304

TNGraph::TNode::IsOutNId
bool IsOutNId(const int &NId) const
Definition: graph.h:369

TNGraph::TNode::GetNbrNId
int GetNbrNId(const int &NodeN) const
Definition: graph.h:367

THash::Len
int Len() const
Definition: hash.h:228

TBPGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:977

TNEGraph::MxEId
TInt MxEId
Definition: graph.h:796

TUNGraph::AddNode
int AddNode(const TNodeI &NodeI)
Adds a node of ID NodeI.GetId() to the graph.
Definition: graph.h:206

TUNGraph::TNodeI::TNodeI
TNodeI(const THashIter &NodeHIter)
Definition: graph.h:74

TNEGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:714

TNEGraph::TNodeI::IsInEId
bool IsInEId(const int &EId) const
Tests whether the edge with ID EId is an in-edge of current node.
Definition: graph.h:758

TNGraph::TNode::IsNbrNId
bool IsNbrNId(const int &NId) const
Definition: graph.h:370

TNGraph::TEdgeI::operator==
bool operator==(const TEdgeI &EdgeI) const
Definition: graph.h:443

TBPGraph::GetRndNI
TNodeI GetRndNI(TRnd &Rnd=TInt::Rnd)
Returns an interator referring to a random node in the graph.
Definition: graph.h:1142

TBPGraph::IsOk
bool IsOk(const bool &ThrowExcept=true) const
Checks the bipartite graph data structure for internal consistency.
Definition: graph.cpp:803

TUNGraph::DelNode
void DelNode(const int &NId)
Deletes node of ID NId from the graph.
Definition: graph.cpp:67

TSnap::IsBipart
Tests (at compile time) if the graph is a bipartite graph type.
Definition: gbase.h:38

TNEGraph::TEdgeI::operator=
TEdgeI & operator=(const TEdgeI &EdgeI)
Definition: graph.h:775

TNEGraph::TEdgeI::TEdgeI
TEdgeI(const TEdgeI &EdgeI)
Definition: graph.h:774

TBPGraph::TEdgeI
Edge iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:1018

TNGraph::TNode::Save
void Save(TSOut &SOut) const
Definition: graph.h:360

TNGraph::operator=
TNGraph & operator=(const TNGraph &Graph)
Definition: graph.h:499

TBPGraph::TEdgeI::CurEdge
int CurEdge
Definition: graph.h:1021

TNEGraph::TNodeI
Node iterator. Only forward iteration (operator++) is supported.
Definition: graph.h:706

TUNGraph::TEdgeI::CurEdge
int CurEdge
Definition: graph.h:124

TNGraph::TEdgeI::TEdgeI
TEdgeI()
Definition: graph.h:435

TNGraph::AddEdge2
int AddEdge2(const int &SrcNId, const int &DstNId)
Adds an edge from node IDs SrcNId to node DstNId to the graph. If nodes do not exist, create them.
Definition: graph.cpp:336

TNGraph::TEdgeI::GetDstNId
int GetDstNId() const
Returns the destination node of the edge.
Definition: graph.h:449

TNGraph::TNode::IsInNId
bool IsInNId(const int &NId) const
Definition: graph.h:368

TUNGraph::TNodeI::operator<
bool operator<(const TNodeI &NodeI) const
Definition: graph.h:84

TBPGraph::TNode::GetInDeg
int GetInDeg() const
Definition: graph.h:955

TUNGraph::operator=
TUNGraph & operator=(const TUNGraph &Graph)
Definition: graph.h:188

TNGraph::TNodeI::GetOutNId
int GetOutNId(const int &NodeN) const
Returns ID of NodeN-th out-node (the node the current node points to).
Definition: graph.h:416

TNEGraph::TNodeI::GetDeg
int GetDeg() const
Returns degree of the current node, the sum of in-degree and out-degree.
Definition: graph.h:726

TNGraph::Empty
bool Empty() const
Tests whether the graph is empty (has zero nodes).
Definition: graph.h:610

TUNGraph::TEdgeI::operator++
TEdgeI & operator++(int)
Increment iterator.
Definition: graph.h:131

TNEGraph::TEdgeI::THashIter
THash< TInt, TEdge >::TIter THashIter
Definition: graph.h:768

THash::GetKey
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:252

TNEGraph::TNodeI::GetInDeg
int GetInDeg() const
Returns in-degree of the current node.
Definition: graph.h:728

TBPGraph::GetEI
TEdgeI GetEI(const int &EId) const
Not supported/implemented!

TUNGraph::TEdgeI::TEdgeI
TEdgeI(const TNodeI &NodeI, const TNodeI &EndNodeI, const int &EdgeN=0)
Definition: graph.h:127

TUNGraph::TEdgeI::TEdgeI
TEdgeI()
Definition: graph.h:126

TBPGraph::TNodeI::IsLeft
bool IsLeft() const
Tests whether the node is left hand side node.
Definition: graph.h:991

TUNGraph::TUNGraph
TUNGraph(const int &Nodes, const int &Edges)
Constructor that reserves enough memory for a graph of Nodes nodes and Edges edges.
Definition: graph.h:164

TNEGraph::IsNode
bool IsNode(const int &NId) const
Tests whether ID NId is a node.
Definition: graph.h:838

TNGraph::TEdgeI::TEdgeI
TEdgeI(const TEdgeI &EdgeI)
Definition: graph.h:437

TUNGraph::TEdgeI::operator=
TEdgeI & operator=(const TEdgeI &EdgeI)
Definition: graph.h:129

TUNGraph::TNodeI::GetInNId
int GetInNId(const int &NodeN) const
Returns ID of NodeN-th in-node (the node pointing to the current node).
Definition: graph.h:101

TBPGraph::Save
void Save(TSOut &SOut) const
Saves the graph to a (binary) stream SOut.
Definition: graph.h:1060

TVec< TInt >

TBPGraph::TBPGraph
TBPGraph(TSIn &SIn)
Constructor for loading the graph from a (binary) stream SIn.
Definition: graph.h:1058

TNGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:390

TNGraph::ReserveNIdOutDeg
void ReserveNIdOutDeg(const int &NId, const int &OutDeg)
Reserves memory for node ID NId having OutDeg out-edges.
Definition: graph.h:618

TSnap::IsMultiGraph::Val
Definition: gbase.h:30

TNEGraph::TNEGraph
TNEGraph()
Definition: graph.h:800

TUNGraph::AddEdgeUnchecked
int AddEdgeUnchecked(const int &SrcNId, const int &DstNId)
Adds an edge between node IDs SrcNId and DstNId to the graph.
Definition: graph.cpp:103

TUNGraphMtx
Definition: gsvd.h:29

TNEGraph::TNodeI::IsNbrNId
bool IsNbrNId(const int &NId) const
Tests whether node with ID NId is a neighbor of the current node.
Definition: graph.h:749

PUNGraph
TPt< TUNGraph > PUNGraph
Pointer to an undirected graph (TUNGraph)
Definition: graph.h:5

TNEGraph::GetMxNId
int GetMxNId() const
Returns an ID that is larger than any node ID in the graph.
Definition: graph.h:846

THash::GetI
TIter GetI(const TKey &Key) const
Definition: hash.h:220

TBPGraph::TNodeI::GetInNId
int GetInNId(const int &NodeN) const
Returns ID of NodeN-th in-node (the node pointing to the current node).
Definition: graph.h:1002

TNEGraph::TNode::InEIdV
TIntV InEIdV
Definition: graph.h:673

TNEGraph::TEdge::GetId
int GetId() const
Definition: graph.h:700

TUNGraph::TNodeI::IsInNId
bool IsInNId(const int &NId) const
Tests whether node with ID NId points to the current node.
Definition: graph.h:113

TNGraph::TNet
TNGraph TNet
Definition: graph.h:348