Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- pushQueue(q, start);
- while (q->head != NULL)
- {
- q->head = frontQueue(q);
- for (int i = 1; i <= n; i++)
- {
- if (map[n + 1][m + 1] == 1)
- pushQueue(q, i);
- if (map[n + 1][m + 1] == end)
- break;
- }
- popQueue(q);
- }
Advertisement
Add Comment
Please, Sign In to add comment