Procedure

Breadth-First Search (BFS) with open and closed lists

1. Initialization:
• Enter the number of nodes in the graph.
• Enter the starting node for the BFS traversal.
2. Create the Graph:
• Choose the method of creating the graph:
• If choosing "Random", generate connections between nodes randomly.
• If choosing "Manual", proceed to step 3 for manual node connection.
3. Manual Graph Creation (if selected):
• Choose the "Manual" option.
• Click on the nodes to connect them manually until all desired connections are made
• Once done, proceed to step 4.
4. Start BFS Traversal:
• Click on the "Go" button to start the BFS traversal.
• The traversal progresses step by step, expanding nodes and adding them to the open list while marking them as visited and moving them to the closed list.
• Display the current queue traversal and the nodes in the closed list.
5. View Results:
• Once the BFS traversal is complete, display the final result.
• Show the order of traversal, highlighting how the algorithm explored the graph.
• Display any relevant information about the nodes visited during traversal.
6. Reload and Reset:
• If desired, use the "Reload" button to reload the graph and start over with the same settings.
• Alternatively, use the "Reset" button to reset the application, clearing all settings and starting from scratch.