Graph Class Reference

Collaboration diagram for Graph:

Public Member Functions
	Graph (int V, int E)
void	addEdge (int src, int dst, int weight)
	Graph (int V)
void	addEdge (int src, int dst, int weight)
	Graph (Graph &&)=default
Graph &	operator= (Graph &&)=default
	Graph (Graph const &)=default
Graph &	operator= (Graph const &)=default
	Graph (unsigned int vertices, AdjList const &adjList)
	Graph (unsigned int vertices, AdjList &&adjList)
	Graph (unsigned int vertices, std::vector< Edge > const &edges)
std::remove_reference_t< AdjList > const &	getAdjList () const
std::remove_reference_t< unsigned int > const &	getVertices () const
void	addVertices (unsigned int num=1)
void	addEdge (Edge const &edge)
void	addEdge (unsigned int source, unsigned int destination)
void	set_graph (void)
void	ford_fulkerson (void)
void	print_flow_info (void)
	Graph (const int V)
void	addEdge (int src, int dst, int weight)

Public Attributes
int	vertexNum
int	edgeNum
Edge *	edges
int **	edges

Private Member Functions
bool	bfs (int source, int sink)

Private Attributes
unsigned int	m_vertices
AdjList	m_adjList
int	residual_capacity [MAXN][MAXN]
int	capacity [MAXN][MAXN]
int	total_nodes
int	total_edges
int	source
int	sink
int	parent [MAXN]
std::vector< std::tuple< int, int, int > >	edge_participated
std::bitset< MAXN >	visited
int	max_flow = 0

Detailed Description

Implementation of graph class.

The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" & "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1).

Constructor & Destructor Documentation

Graph() [1/3]

Graph::Graph ( unsigned int  vertices, AdjList const &  adjList  )

inline

Create a graph from vertices and adjacency list.

Parameters

vertices	specify the number of vertices the graph would contain.
adjList	is the adjacency list representation of graph.

        : m_vertices(vertices), m_adjList(adjList) {}

Graph() [2/3]

Graph::Graph ( unsigned int  vertices, AdjList &&  adjList  )

inline

Create a graph from vertices and adjacency list.

Parameters

vertices	specify the number of vertices the graph would contain.
adjList	is the adjacency list representation of graph.

        : m_vertices(std::move(vertices)), m_adjList(std::move(adjList)) {}

Graph() [3/3]

Graph::Graph ( unsigned int  vertices, std::vector< Edge > const &  edges  )

inline

Create a graph from vertices and a set of edges.

Adjacency list of the graph would be created from the set of edges. If the source or destination of any edge has a value greater or equal to number of vertices, then it would throw a range_error.

Parameters

vertices	specify the number of vertices the graph would contain.
edges	is a vector of edges.

        : m_vertices(vertices) {
        for (auto const& edge : edges) {
            if (edge.src >= vertices || edge.dest >= vertices) {
                throw std::range_error(
                    "Either src or dest of edge out of range");
            }
            m_adjList[edge.src].emplace_back(edge.dest);
        }
    }

Member Function Documentation

addEdge() [1/2]

void Graph::addEdge ( Edge const &  edge )

inline

Add an edge in the graph.

Parameters

edge	that needs to be added.

                                   {
        if (edge.src >= m_vertices || edge.dest >= m_vertices) {
            throw std::range_error("Either src or dest of edge out of range");
        }
        m_adjList[edge.src].emplace_back(edge.dest);
    }

addEdge() [2/2]

void Graph::addEdge ( unsigned int  source, unsigned int  destination  )

inline

Add an Edge in the graph

Parameters

source	is source vertex of the edge.
destination	is the destination vertex of the edge.

                                                                {
        if (source >= m_vertices || destination >= m_vertices) {
            throw std::range_error(
                "Either source or destination of edge out of range");
        }
        m_adjList[source].emplace_back(destination);
    }

addVertices()

void Graph::addVertices ( unsigned int  num = 1 )

inline

Add vertices in the graph.

Parameters

num	is the number of vertices to be added. It adds 1 vertex by default.

{ m_vertices += num; }

getAdjList()

std::remove_reference_t<AdjList> const& Graph::getAdjList ( ) const

inline

Return a const reference of the adjacency list.

Returns

const reference to the adjacency list

                                                             {
        return m_adjList;
    }

getVertices()

std::remove_reference_t<unsigned int> const& Graph::getVertices ( ) const

inline

Returns

number of vertices in the graph.

                                                                   {
        return m_vertices;
    }

---

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

• dynamic_programming/bellman_ford.cpp
• dynamic_programming/floyd_warshall.cpp
• graph/cycle_check_directed_graph.cpp
• graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
• greedy_algorithms/dijkstra.cpp