## Minimum Spanning trees Prim’s Algorithm

minimum spanning tree definition: What is minimum spanning tree Minimum Spanning trees Prim’s Algorithm. A minimum spanning tree of a connected undirected graph is a tree which connects all...

## shortest path problem dijkstra’s algorithm

shortest path problem Shortest path problem can be defined as a problem to find minimum distance between two vertices/nodes of connected weighted graph.Dijkstra’s algorithm is an efficient algorithm for...

BFS or breadth first search or breadth first traversal of a graph is algorithm in which we visit from root node to all adjacent children of  root node. i.e...

## Depth first traversal of graph ( DFS)

Traversing a graph means visiting the nodes. In computer science the different  ways of visiting nodes gives different results (sequence). In Depth first traversal of a graph , we...

## Graph Adjacency List Representation in C

Graph as adjacency List Adjacency list of a graph ( here undirected graph) is another way to represent other than matrix representation. From above figure it clear that adjacency...