#include <GenericGraph.h>

Inheritance diagram for SVF::GenericGraph< NodeTy, EdgeTy >:

Public Types
typedef NodeTy	NodeType

typedef EdgeTy	EdgeType

typedef OrderedMap< NodeID, NodeType * >	IDToNodeMapTy
	NodeID to GenericNode map.

typedef IDToNodeMapTy::iterator	iterator
	Node Iterators.

typedef IDToNodeMapTy::const_iterator	const_iterator

Public Member Functions
	GenericGraph ()
	Constructor.

virtual	~GenericGraph ()
	Destructor.

void	destroy ()
	Release memory.

iterator	begin ()
	Iterators.

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

void	addGNode (NodeID id, NodeType *node)
	Add a Node.

NodeType *	getGNode (NodeID id) const
	Get a node.

bool	hasGNode (NodeID id) const
	Has a node.

void	removeGNode (NodeType *node)
	Delete a node.

u32_t	getTotalNodeNum () const
	Get total number of node/edge.

u32_t	getTotalEdgeNum () const

void	incNodeNum ()
	Increase number of node/edge.

void	incEdgeNum ()

Public Attributes
u32_t	edgeNum
	total num of node

u32_t	nodeNum
	total num of edge

Protected Attributes
IDToNodeMapTy	IDToNodeMap
	node map

Friends
class	GenericGraphWriter< NodeTy, EdgeTy >

class	GenericGraphReader< NodeTy, EdgeTy >

Detailed Description

template<class NodeTy, class EdgeTy>
class SVF::GenericGraph< NodeTy, EdgeTy >

Definition at line 337 of file GenericGraph.h.

Member Typedef Documentation

◆ const_iterator

template<class NodeTy , class EdgeTy >

typedef IDToNodeMapTy::const_iterator SVF::GenericGraph< NodeTy, EdgeTy >::const_iterator

Definition at line 351 of file GenericGraph.h.

◆ EdgeType

template<class NodeTy , class EdgeTy >

typedef EdgeTy SVF::GenericGraph< NodeTy, EdgeTy >::EdgeType

Definition at line 344 of file GenericGraph.h.

◆ IDToNodeMapTy

template<class NodeTy , class EdgeTy >

typedef OrderedMap<NodeID, NodeType*> SVF::GenericGraph< NodeTy, EdgeTy >::IDToNodeMapTy

NodeID to GenericNode map.

Definition at line 346 of file GenericGraph.h.

◆ iterator

template<class NodeTy , class EdgeTy >

typedef IDToNodeMapTy::iterator SVF::GenericGraph< NodeTy, EdgeTy >::iterator

Node Iterators.

Definition at line 350 of file GenericGraph.h.

◆ NodeType

template<class NodeTy , class EdgeTy >

typedef NodeTy SVF::GenericGraph< NodeTy, EdgeTy >::NodeType

Definition at line 343 of file GenericGraph.h.

Constructor & Destructor Documentation

◆ GenericGraph()

template<class NodeTy , class EdgeTy >

SVF::GenericGraph< NodeTy, EdgeTy >::GenericGraph ( )

inline

Constructor.

Definition at line 355 of file GenericGraph.h.

355: edgeNum(0), nodeNum(0) {}

SVF::GenericGraph::edgeNum

u32_t edgeNum

total num of node

Definition GenericGraph.h:446

SVF::GenericGraph::nodeNum

u32_t nodeNum

total num of edge

Definition GenericGraph.h:447

◆ ~GenericGraph()

template<class NodeTy , class EdgeTy >

virtual SVF::GenericGraph< NodeTy, EdgeTy >::~GenericGraph ( )

inlinevirtual

Destructor.

Definition at line 358 of file GenericGraph.h.

    {
        destroy();
    }

Member Function Documentation

◆ addGNode()

template<class NodeTy , class EdgeTy >

void SVF::GenericGraph< NodeTy, EdgeTy >::addGNode	(	NodeID	id,
		NodeType *	node
	)

inline

Add a Node.

Definition at line 390 of file GenericGraph.h.

    {
        IDToNodeMap[id] = node;
        nodeNum++;
    }

◆ begin() [1/2]

template<class NodeTy , class EdgeTy >

iterator SVF::GenericGraph< NodeTy, EdgeTy >::begin ( )

inline

Iterators.

Definition at line 371 of file GenericGraph.h.

    {
        return IDToNodeMap.begin();
    }

◆ begin() [2/2]

template<class NodeTy , class EdgeTy >

const_iterator SVF::GenericGraph< NodeTy, EdgeTy >::begin ( ) const

inline

Definition at line 379 of file GenericGraph.h.

    {
        return IDToNodeMap.begin();
    }

◆ destroy()

template<class NodeTy , class EdgeTy >

void SVF::GenericGraph< NodeTy, EdgeTy >::destroy ( )

inline

Release memory.

Definition at line 364 of file GenericGraph.h.

    {
        for (auto &entry : IDToNodeMap)
            delete entry.second;
    }

◆ end() [1/2]

template<class NodeTy , class EdgeTy >

iterator SVF::GenericGraph< NodeTy, EdgeTy >::end ( )

inline

Definition at line 375 of file GenericGraph.h.

    {
        return IDToNodeMap.end();
    }

◆ end() [2/2]

template<class NodeTy , class EdgeTy >

const_iterator SVF::GenericGraph< NodeTy, EdgeTy >::end ( ) const

inline

Definition at line 383 of file GenericGraph.h.

    {
        return IDToNodeMap.end();
    }

◆ getGNode()

template<class NodeTy , class EdgeTy >

NodeType * SVF::GenericGraph< NodeTy, EdgeTy >::getGNode ( NodeID id ) const

inline

Get a node.

Definition at line 397 of file GenericGraph.h.

    {
        const_iterator it = IDToNodeMap.find(id);
        assert(it != IDToNodeMap.end() && "Node not found!");
        return it->second;
    }

◆ getTotalEdgeNum()

template<class NodeTy , class EdgeTy >

u32_t SVF::GenericGraph< NodeTy, EdgeTy >::getTotalEdgeNum ( ) const

inline

Definition at line 428 of file GenericGraph.h.

    {
        return edgeNum;
    }

◆ getTotalNodeNum()

template<class NodeTy , class EdgeTy >

u32_t SVF::GenericGraph< NodeTy, EdgeTy >::getTotalNodeNum ( ) const

inline

Get total number of node/edge.

Definition at line 424 of file GenericGraph.h.

    {
        return nodeNum;
    }

◆ hasGNode()

template<class NodeTy , class EdgeTy >

bool SVF::GenericGraph< NodeTy, EdgeTy >::hasGNode ( NodeID id ) const

inline

Has a node.

Definition at line 405 of file GenericGraph.h.

    {
        const_iterator it = IDToNodeMap.find(id);
        return it != IDToNodeMap.end();
    }

◆ incEdgeNum()

template<class NodeTy , class EdgeTy >

void SVF::GenericGraph< NodeTy, EdgeTy >::incEdgeNum ( )

inline

Definition at line 437 of file GenericGraph.h.

    {
        edgeNum++;
    }

◆ incNodeNum()

template<class NodeTy , class EdgeTy >

void SVF::GenericGraph< NodeTy, EdgeTy >::incNodeNum ( )

inline

Increase number of node/edge.

Definition at line 433 of file GenericGraph.h.

    {
        nodeNum++;
    }

◆ removeGNode()

template<class NodeTy , class EdgeTy >

void SVF::GenericGraph< NodeTy, EdgeTy >::removeGNode ( NodeType * node )

inline

Delete a node.

Definition at line 412 of file GenericGraph.h.

    {
        assert(node->hasIncomingEdge() == false
               && node->hasOutgoingEdge() == false
               && "node which have edges can't be deleted");
        iterator it = IDToNodeMap.find(node->getId());
        assert(it != IDToNodeMap.end() && "can not find the node");
        IDToNodeMap.erase(it);
        delete node;
    }