The program takes a matrix as an input. Using the matrix it finds the best path to give the highest result. The program checks all roots and finds which path is the most rewarding. This program traverses through a matrix type file and finds the path which will give the highest result. The program uses a FOR loop to cycle through the matrix.
-
Notifications
You must be signed in to change notification settings - Fork 0
Pranushan157/Digger
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This program traverses through a matrix type file and finds the path which will give the highest result.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published