Admin

Introduction In graph theory, the shortest path problem is the problem of finding a path between two vertices/nodes (as source and destination) in a graph such that the sum of the weights/costs of its constituent edges route is minimized. The shortest path problem is considered as – The single-pair shortest path problem: It includes – The single-source shortest path problem, in which Read more…

Introduction of Minimum Cost Spanning Tree The minimum (Cost) Spanning Tree is also known as MST. Definition of MST A Minimum Cost Spanning Tree is a way of connecting all the points (or nodes) in a network with the least possible total cost, without creating any closed loops or cycles. Read more…

Introduction of Representation of Graph Graphs are believed to be a way of expressing relationships between pairs of items and are one of the most important abstractions in computer science. Definition The representation of a graph is a way to store graphical format inside the computer’s memory in the binary Read more…

Introduction of Traversal in Graph Traversal means the act or process of passing across, over, touching, or through and doing something with the data. A graph traversal technique visits every node exactly once in a systematic fashion. Definition Graph traversal is a process for accessing/searching all the vertices data values Read more…