New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

using wavefront/grassfire algorithm #5

Open

tiffanalin opened this issue Dec 8, 2022 · 1 comment

Assignees

Labels

Owner

tiffanalin commented Dec 8, 2022

No description provided.

tiffanalin added the enhancement label

tiffanalin self-assigned this

tiffanalin changed the title ~~write code for finding the shortest path between A and B~~ using Dijkstra's algorithm

Owner Author

tiffanalin commented Jan 1, 2023

create a graph representing 8x8 grid (each cell represents a node)
define starting node and destination node
initialize an array to store shortest distance from starting node to each node.

tiffanalin changed the title ~~using Dijkstra's algorithm~~ using wavefront/grassfire algorithm

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment