https://github.com/danilomurer/pathfinder

Find Path with the lowest sum from node x to node y
https://github.com/danilomurer/pathfinder

Last synced: 4 days ago
JSON representation

Find Path with the lowest sum from node x to node y

• Host: GitHub
• URL: https://github.com/danilomurer/pathfinder
• Owner: DaniloMurer
• Created: 2019-04-15T13:54:21.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2019-05-15T08:47:09.000Z (over 5 years ago)
• Last Synced: 2024-10-11T15:45:14.839Z (28 days ago)
• Language: Java
• Size: 355 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
Pathfinder

=====

Find Path with the lowest sum from node x to node y.

1. Demands and short explanation of the project

    - [x] Checks if the bottom cell is smaller than the right one

    - [x] Can only move down or right

    - [x] You can give a custom size to the grid

    - [x] Has some JUnit testing implemented

    - [x] Does essentially work

    

2. Sources

    - Mathematical approach of the problem: [Project Euler 81](https://www.mathblog.dk/project-euler-81-find-the-minimal-path-sum-from-the-top-left-to-the-bottom-right-by-moving-right-and-down/)

    

---