GraphAlgorithms

Search This Blog

About

Get link
Facebook
X
Pinterest
Email
Other Apps

This is the Home Assignment for Group 9 S.Y CS-A.

Authors:

Aniruddha Bargaje

Deven Bhadane

Shubham Bodake

Ranjana Burange

Rutika Deshmukh

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Graph representations

The following two are the most commonly used representations of a graph. 1. Adjacency Matrix 2. Adjacency List There are other representations also like, Incidence Matrix and Incidence List. The choice of graph representation is situation-specific. It totally depends on the type of operations to be performed and ease of use. Adjacency Matrix: Adjacency Matrix is a 2D array of size V x V where V is the number of vertices in a graph. Let the 2D array be adj[][], a slot adj[i][j] = 1 indicates that there is an edge from vertex i to vertex j. Adjacency matrix for undirected graph is always symmetric. Adjacency Matrix is also used to represent weighted graphs. If adj[i][j] = w, then there is an edge from vertex i to vertex j with weight w. Consider a graph with no. of vertices as V , the adjacency matrix of such a graph is a binary matrix of size V x V. Let us assume the matrix as A , element Aij is 1 if there is an edge from vertex i t...

Powered by Blogger

About

Comments

Post a Comment