Notes:
1. in BFS, need to check if a node is already seen before or not.
2. BFS can create shortest path (by using parent arrays)
1. in BFS, need to check if a node is already seen before or not.
2. BFS can create shortest path (by using parent arrays)
No comments:
Post a Comment