DFS and BFS Graphs
1 like172 views
This document contains the results of running depth-first search (DFS) and breadth-first search (BFS) algorithms on 5 graphs using implementations on a local machine and a FLIP server, as part of a data structures assignment submitted by Arif Adatia. For each graph, the recursive DFS version is listed first as the correct output, followed by results from running the student's DFS and BFS functions locally and on the FLIP server.
DFS and BFS Graphs
- 1. Graph 1 DFS Recursive (Correct Version) Local machine (Using my DFS function) Local machine (Using my BFS function) FLIP server(Using my DFS function) Student Name: Arif Adatia Course: CS261- Data Structures Assignment 07- DFS and BFS Graphs 1-5 run results as in local machine and FLIP server
- 2. FLIP server(Using my BFS function) Graph2 DFS Recursive (Correct Version)
- 3. Graph2 Local machine (Using my DFS function) Local machine (Using my BFS function)
- 4. FLIP server(Using my DFS function) FLIP server(Using my BFS function)
- 5. Graph3 DFS Recursive (Correct Version)
- 7. Graph 3 Local machine (Using my DFS function)
- 9. Local machine (Using my BFS function)
- 10. Graph 3: FLIP server (Using my DFS function) .... ....
- 12. Graph 3 FLIP server (Using my BFS function) ....................
- 14. ... ... ... ... Graph 4 DFS Recursive (Correct Version) – ALL are REACHABLE Local machine (Using my DFS function)- ALL are REACHABLE
- 15. Local machine (Using my BFS function) - ALL are REACHABLE FLIP server (Using my DFS function) - ALL are REACHABLE .......
- 16. FLIP server (Using my BFS function) ALL are REACHABLE ...
- 17. Graph 5 - DFS Recursive (Correct Version) – ALL are REACHABLE Local machine (Using my DFS function)- ALL are REACHABLE
- 18. FLIP server (Using my DFS function) ALL are REACHABLE ...... Local machine (Using my BFS function) - ALL are REACHABLE
- 19. FLIP server (Using my BFS function) ALL are REACHABLE ..... ............... END of Results..............