##### BFS Implementation in Python

Breadth First Search (BFS) algorithm is used to traverse a graph in a breadth ward motion. BFS Algorithm use data structure queue to remember to get the next vertex to start the search and we will required an array to keep the track of vertex that it is visited or unvisited.

##### Implementation of Floyd Warshall Algorithm - C++

Floyd Warshall algorithm is used to find the shortest distance between the every pair of vertices in a given weight directed graph which does not contain any cycles of negative length ( The total length of any cycle in the graph should not be negative).

##### Implementation of Weighted Graph using STL

In this post we are discussing how to implement weighted graph using STL. Program is also given below. In this program we used an array of vectors of pair vectors. vector is an sequence container which is used to store adjacency list of the graph.

##### Implementation of Dijsktra's Shortest Path Algorithm using STL

This algorithm is also called greedy technique. This algorithm works by maintaining a set S of vertices whose shortest distance from the source is already known. Initially that set S contains only source vertex

##### Graph Implementation using C++ STL

The most common and basic reprsentation of graphs are Adjacency List (using Linked List) and Adjacency matrix. But the question is that why to use C++ STL to implement graph when we can easily represent the graph using adjacency matrix (In which arrays are used) or Adjacency list (using Linked List).

##### C++ Program to check if a Directed Graph is Strongly Connected or Not

##### C++ Program to Traverse a Graph using DFS (Depth First Search)

Depth First Search (DFS) algorithm is used to traverse a graph depthward motion. DFS Algorithm use data structure stack to remember to get the next vertex to start the search and we will requred an array to keep the track of vertex that it is visited or unvisited.

##### C++ Program to Traverse a Graph Using BFS (Breadth First Search)

Breadth First Search (BFS) algorithm is used to traverse a graph in a breadthward motion. BFS Algorithm use data structure queue to remember to get the next vertex to start the search and we will requred an array to keep the track of vertex that it is visited or unvisited.