In our previous post Application of Graph – Shortest Path Problems we discussed the findings of the optimal path or the shortest path between the nodes of a graph. We talk
A subgraph T of a connected, undirected and weighted graph G(V, E) referred as Spanning Tree provided, Subgraph possesses all the vertices of the graph G(V, E) Subgraph
Determining the optimal path(such that the sum of weight of its constituent edges is minimum) between the nodes of a weighted graph is referred as Shortest Path Problems.
Visiting every vertices of a graph is referred as Graph Traversal, which is of two ways, Breadth First Traversing Depth First Traversing Most of the problems that we’ve
A graph can have several ways of representation, each one has their respective uses. However, the most commonly used are the Adjacency list and Adjacency Matrix. Read about graph –
