Skip to content

rhnmht30/e-yantra

Repository files navigation

e-yantra

Task 1A: Calculate shortest path using BFS and plot that in given maze image.

Task 1A Demo

Task 1B: Calculate shortest path using BFS, built socket server in C to throw dyanmic obstacles, re-calculate shortest path.

Task 1B Demo

Task 1C: Calculate shortest path using BFS, extract images of numbers along the shortest path.

Task 1C Demo

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages