Way Finder is a program designed to assist travelers and tourists in exploring a new country while staying within budget constraints. The program represents a transportation network as a graph and provides various features to help users navigate efficiently while considering costs.

• Allows traversal using Breadth First Search (BFS) or Depth First Search (DFS) algorithms.
• Users input the starting city and select their preferred traversal algorithm.

• Update: Modify existing transportation details.
• Add: Add new transportation options.
• Delete: Remove existing transportation options (ensuring the graph remains connected).

• Determines whether the transportation network is complete (each city is connected to every other city).

• Users input source city, destination city, and budget.
• The program lists all available transportation options within the given budget, sorted by cost.

• The program starts by reading transportation data from a file (if it exists).
• The data is structured into an adjacency map for efficient graph representation.

• Users select a starting point and traverse using BFS or DFS.

• Users input their current location, desired destination, and available budget.
• The program finds all possible paths between the cities that fit within the budget, sorting results by cost.

• Users can delete, edit, or add transportation routes.
• Deleting a transportation option is restricted if it would disconnect the graph.

• After modifications, the program checks if the graph is complete or not.

• Upon closing the program, the updated graph data is saved back to the file to persist changes.

• Programming Language: C++, C
• Graph Algorithms: BFS, DFS