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

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

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

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

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

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

     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:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TBPGraph::bgsLeft
Definition: graph.h:860

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TBPGraph::TNodeTy
TNodeTy
Definition: graph.h:860

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TNEGraph
Directed multigraph.
Definition: graph.h:585

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

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

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

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

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

TVecPool< TInt >

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TNEGraph::TNet
TNEGraph TNet
Definition: graph.h:587

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TSIn
Definition: fl.h:58

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

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

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

TBPGraph::TNode
Definition: graph.h:862

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TBPGraph::bgsRight
Definition: graph.h:860

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TNGraph::AddEdge
int AddEdge(const int &SrcNId, const int &DstNId)
Adds an edge from node IDs 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:994

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

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

TNGraphMtx
Definition: gsvd.h:5

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TNGraph::TNode
Definition: graph.h:312

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

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

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

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

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

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

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

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

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

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

TBPGraph::TNet
TBPGraph TNet
Definition: graph.h:858

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

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

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

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

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

TUNGraph::AddNodeUnchecked
int AddNodeUnchecked(int NId=-1)
Adds a node of ID NId to the graph without performing checks.
Definition: graph.cpp:20

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

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

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

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

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

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

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

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

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

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

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

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

TSOut
Definition: fl.h:128

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

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

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

TBPGraph::bgsUndef
Definition: graph.h:860

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

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

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

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

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

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

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

TInt
Definition: dt.h:1044

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TNGraph
Directed graph.
Definition: graph.h:307

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TBPGraph
Bipartite graph.
Definition: graph.h:856

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

THash
Definition: hash.h:88

TBPGraph::bgsBoth
Definition: graph.h:860

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

TNGraph::AddNodeUnchecked
int AddNodeUnchecked(int NId=-1)
Adds a node of ID NId to the graph without performing checks.
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:92

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

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

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

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

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

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

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

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

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

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

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

THash::IsKey
bool IsKey(const TKey &Key) const
Definition: hash.h:216

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

TBPGraph::TNode::PackNIdV
void PackNIdV()
Definition: graph.h:884

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

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

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

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

TNGraph::TNode::GetInNId
int GetInNId(const int &NodeN) const
Definition: graph.h:326

TNGraph::TNode::GetDeg
int GetDeg() const
Definition: graph.h:323

TNEGraph::TNode
Definition: graph.h:590

TUNGraph::TNode::GetDeg
int GetDeg() const
Definition: graph.h:48

TNGraph::TEdgeI::operator<
bool operator<(const TEdgeI &EdgeI) const
Definition: graph.h:398

TUNGraph::ReserveNIdDeg
void ReserveNIdDeg(const int &NId, const int &Deg)
Reserves memory for node ID NId having Deg edges.
Definition: graph.h:265

TNGraph::TNode::IsOutNId
bool IsOutNId(const int &NId) const
Definition: graph.h:330

TNGraph::TNode::GetNbrNId
int GetNbrNId(const int &NodeN) const
Definition: graph.h:328

THash::Len
int Len() const
Definition: hash.h:186

TBPGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:897

TNEGraph::MxEId
TInt MxEId
Definition: graph.h:716

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

TUNGraph::TNodeI::TNodeI
TNodeI(const THashIter &NodeHIter)
Definition: graph.h:70

TNEGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:634

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

TNGraph::TNode::IsNbrNId
bool IsNbrNId(const int &NId) const
Definition: graph.h:331

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

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

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

TNEGraph::TEdgeI::TEdgeI
TEdgeI(const TEdgeI &EdgeI)
Definition: graph.h:694

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

TNGraph::TNode::Save
void Save(TSOut &SOut) const
Definition: graph.h:321

TNGraph::operator=
TNGraph & operator=(const TNGraph &Graph)
Definition: graph.h:434

TBPGraph::TEdgeI::CurEdge
int CurEdge
Definition: graph.h:941

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

TUNGraph::TEdgeI::CurEdge
int CurEdge
Definition: graph.h:120

TNGraph::TEdgeI::TEdgeI
TEdgeI()
Definition: graph.h:391

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

TNGraph::TNode::IsInNId
bool IsInNId(const int &NId) const
Definition: graph.h:329

TUNGraph::TNodeI::operator<
bool operator<(const TNodeI &NodeI) const
Definition: graph.h:80

TBPGraph::TNode::GetInDeg
int GetInDeg() const
Definition: graph.h:875

TUNGraph::operator=
TUNGraph & operator=(const TUNGraph &Graph)
Definition: graph.h:164

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

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

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

TUNGraph::TEdgeI::operator++
TEdgeI & operator++(int)
Increment iterator.
Definition: graph.h:127

TNEGraph::TEdgeI::THashIter
THash< TInt, TEdge >::TIter THashIter
Definition: graph.h:688

THash::GetKey
const TKey & GetKey(const int &KeyId) const
Definition: hash.h:210

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

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

TUNGraph::TEdgeI::TEdgeI
TEdgeI()
Definition: graph.h:122

TBPGraph::TNodeI::IsLeft
bool IsLeft() const
Tests whether the node is left hand side node.
Definition: graph.h:911

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

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

TNGraph::TEdgeI::TEdgeI
TEdgeI(const TEdgeI &EdgeI)
Definition: graph.h:393

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

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

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

TVec< TInt >

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

TNGraph::TNodeI::TNodeI
TNodeI(const TNodeI &NodeI)
Definition: graph.h:346

TNGraph::ReserveNIdOutDeg
void ReserveNIdOutDeg(const int &NId, const int &OutDeg)
Reserves memory for node ID NId having OutDeg out-edges.
Definition: graph.h:538

TSnap::IsMultiGraph::Val
Definition: gbase.h:30

TNEGraph::TNEGraph
TNEGraph()
Definition: graph.h:720

TUNGraph::AddEdgeUnchecked
int AddEdgeUnchecked(const int &SrcNId, const int &DstNId)
Adds an edge from node IDs SrcNId to node DstNId to the graph without performing checks.
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:669

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

THash::GetI
TIter GetI(const TKey &Key) const
Definition: hash.h:178

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

TNEGraph::TNode::InEIdV
TIntV InEIdV
Definition: graph.h:593

TNEGraph::TEdge::GetId
int GetId() const
Definition: graph.h:620

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

TNGraph::TNet
TNGraph TNet
Definition: graph.h:309