Breadth first traversal for a Graph

Implementation of BFS using adjacency list. Here given code implementation process.

1) Implementation of BFS using adjacency list in c 2) Implementation of BFS using adjacency list in java 3) Implementation of BFS using adjacency list in c++ 4) Implementation of BFS using adjacency list in c# 5) Implementation of BFS using adjacency list in php 6) Implementation of BFS using adjacency list in python 7) Implementation of BFS using adjacency list in ruby 8) Implementation of BFS using adjacency list in swift 9) Implementation of BFS using adjacency list in scala 10) Implementation of BFS using adjacency list in vb.net 11) Implementation of BFS using adjacency list in golang 12) Implementation of BFS using adjacency list in node js 13) Implementation of BFS using adjacency list in typescript 14) Implementation of BFS using adjacency list in kotlin

In above program is capable to deal with directed and undirected graph which is form of adjacency list.