A C++ program used to find the shortest path from the top-left to the bottom-right corner of a table using Bellman-Ford algorithm.
- Grid Generation: Generates a random grid of integers representing traversal costs.
- Shortest Path Computation: Determines the shortest path from the top-left to bottom-right using dynamic programming, considering only right and down movements.
- Displaying the Grid: Displays the generated grid on the standard output for visualization.
- Writing Results to File: Writes the grid, shortest path cost, and directions to "data.txt" after computation.
- Dynamic Memory Management: Properly manages memory allocation for grid representation and path information.
- Class Structure: Organized into a class for better organization and reusability.
- Support for Custom Grid Size: Allows users to specify grid dimensions for analysis.
- Randomness: Generates random grid values for varied configurations.
- Directional Tracking: Tracks directions in the shortest path for traversal insights.
