The components of the matrix express whether the. If adj = w, then there is an edge from vertex i to vertex j with weight w. In graph theory, an adjacency matrix is nothing but a square matrix utilised to describe a finite graph. Adjacency Matrix is also used to represent weighted graphs. Adjacency matrix for undirected graph is always symmetric. Let the 2D array be adj, a slot adj = 1 indicates that there is an edge from vertex i to vertex j. It totally depends on the type of operations to be performed and ease of use.Īdjacency Matrix is a 2D array of size V x V where V is the number of vertices in a graph. The choice of graph representation is situation-specific. There are other representations also like, Incidence Matrix and Incidence List. The following two are the most commonly used representations of a graph. In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

Kruskal’s Minimum Spanning Tree Algorithm | Greedy Algo-2Īttention reader! Don’t stop learning now.

Prim’s Minimum Spanning Tree (MST) | Greedy Algo-5.

Dijkstra's shortest path algorithm | Greedy Algo-7.

Construct Full Binary Tree from given preorder and postorder traversals.

Construct a Binary Tree from Postorder and Inorder.

Construct Tree from given Inorder and Preorder traversals.

Print Postorder traversal from given Inorder and Preorder traversals.

Inorder Tree Traversal without recursion and without stack!.

Inorder Tree Traversal without Recursion.

Tree Traversals (Inorder, Preorder and Postorder).

Breadth First Search or BFS for a Graph.

Unique paths covering every non-obstacle block exactly once in a grid.

Print all possible paths from top left to bottom right of a mXn matrix.

Count all possible paths from top left to bottom right of a mXn matrix.

Count number of ways to reach destination in a Maze.

The Knight’s tour problem | Backtracking-1.

Warnsdorff’s algorithm for Knight’s tour problem.It is a compact way to represent the finite graph containing n vertices of a m x m matrix M. Printing all solutions in N-Queen Problem The adjacency matrix, also called the connection matrix, is a matrix containing rows and columns which is used to represent a simple labelled graph, with 0 or 1 in the position of (V i, V j) according to the condition whether V i and V j are adjacent or not.

Graph implementation using STL for competitive programming | Set 1 (DFS of Unweighted and Undirected).

Graph implementation using STL for competitive programming | Set 2 (Weighted graph).

ISRO CS Syllabus for Scientist/Engineer Exam.

ISRO CS Original Papers and Official Keys.

GATE CS Original Papers and Official Keys.