Design and Implementation of GPU-Based Prim’s Algorithm. Minimum spanning tree is a classical problem in graph theory that plays a key role in a broad domain of applications.

Google made the development of this algorithm even more fun by awarding points for scooping up apples and channeling through open portals, while maneuvering through the 3D maze.

The problem of Micromouse i.e. A Maze Solving Robot is about 32 years old but its importance in the field of Robotics is unparalleled because it requires thorough analysis and paper work.