Nikhil TanwarDistributed Breadth First Search AlgorithmBreadth-first search (BFS) is a graph traversal algorithm that visits all of the nodes in a graph in a specific order: it starts at a…Dec 8, 2022Dec 8, 2022
Nikhil TanwarPrims Algorithmwe can examine what is the minimal spanning tree and how to convert a graph right into a minimal spanning tree the use of Prim’s algorithm…Apr 3, 2022Apr 3, 2022
Nikhil Tanwar“The importance of international collaboration for academia” and how Bennett University is moving…when I joined Bennett University I realized the importance of global collaborations amongst educational institutes which have been an…Jan 1, 2022Jan 1, 2022
Nikhil TanwarMOBILE STORE MANAGEMENT SYSTEMthe idea is to make a one stop mobile solution shop that provides multi brand handsets accessories all under one roof.Dec 20, 2020Dec 20, 2020
