Graph Class Reference

Collaboration diagram for Graph:

Public Member Functions
	Graph (int V)
void	addEdge (int v, int w)
void	BFS (int s)
	Graph (int V)
void	addEdge (int v, int w)
bool	isBC ()
	Graph (int V)
void	addEdge (int v, int w)
void	AP ()
	Graph (int V)
void	addEdge (int v, int w)
bool	isCyclic ()
	Graph (int V)
void	addEdge (int v, int w)
bool	isCyclic ()
	Graph (int V)
void	addEdge (int v, int w)
void	DFS (int v)
	Graph (int V)
void	addEdge (int v, int w)
bool	isEulerianCycle ()
bool	isSC ()
void	DFSUtil (int v, bool visited[])
Graph	getTranspose ()
	Graph (int V)
void	addEdge (int v, int w)
int	isEulerian ()
bool	isConnected ()
void	DFSUtil (int v, bool visited[])
	Graph (int V)
void	addEdge (int v, int w)
void	greedyColoring ()
	Graph (int V)
void	addEdge (int u, int v, int weight)
void	longestPath (int s)
	Graph (int V)
void	addEdge (int v, int w)
void	printSCCs ()
Graph	getTranspose ()
	Graph (int V)
void	addEdge (int v, int w)
void	SCC ()
	Graph (int V)
void	addEdge (int v, int w)
void	topologicalSort ()
	Graph (int V)
void	addEdge (int v, int w)
void	printVertexCover ()

Public Attributes
int	V
int	E
struct Edge *	edge
Edge *	edge

---

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

• src/test-suite/PE-benchmarks/bellman-ford-algorithm.cpp
• src/test-suite/PE-benchmarks/bfs.cpp
• src/test-suite/PE-benchmarks/biconnectivity.cpp
• src/test-suite/PE-benchmarks/boruvkas-algorithm.cpp
• src/test-suite/PE-benchmarks/cut-vertices.cpp
• src/test-suite/PE-benchmarks/detect-cycle-in-a-graph.cpp
• src/test-suite/PE-benchmarks/detect-cycle-undirected-graph.cpp
• src/test-suite/PE-benchmarks/dfs.cpp
• src/test-suite/PE-benchmarks/euler-circuit-directed-graph.cpp
• src/test-suite/PE-benchmarks/eulerian-path-and-circuit.cpp
• src/test-suite/PE-benchmarks/graph-coloring.cpp
• src/test-suite/PE-benchmarks/longest-path-directed-acyclic-graph.cpp
• src/test-suite/PE-benchmarks/strongly-connected-components.cpp
• src/test-suite/PE-benchmarks/tarjan-algorithm.cpp
• src/test-suite/PE-benchmarks/topological-sorting.cpp
• src/test-suite/PE-benchmarks/union-find.cpp
• src/test-suite/PE-benchmarks/vertex-cover-problem.cpp