| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Copy neighbors subroutine | Andinus | 2021-11-18 | 1 | -2/+57 |
| | | |||||
| * | raku/DFS: Add DFS implementation in raku, Add input 06 | Andinus | 2021-11-17 | 1 | -0/+69 |
| | | |||||
| * | java/DFS: Update to latest fornax format, fix DFS | Andinus | 2021-11-16 | 1 | -18/+48 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | Now it prints the starting point and all visited path according to the format. Earlier we marked paths as unvisited right after we backtrack out of it. This is not really necessary for us to get the solution because if we're not able to find a path through that block then we won't find it with another way of reaching that block either. Explanation: AB X. If we can't find a path to destination from AX... then we won't find it form ABX... either. Earlier we were trying ABX... too. I had this idea in mind because before this I wrote a word search program that walked in DFS manner, in that case this was required because ABX... could form a word that AX... couldn't. The solution was easy, just had to keep it marked as visited and not revert it. To keep track of current path we created `path'. This is marked false right after traversal because it keeps track of current path. | ||||
| * | java/BFS: Prettify code | Andinus | 2021-11-16 | 2 | -91/+95 |
| | | |||||
| * | BFS code for maze traversal | Vam-c | 2021-11-05 | 1 | -0/+91 |
| | | | | errors (null) for start object. | ||||
| * | java/DFS: Don't walk on visited, Add DFS solutions, change colors | Andinus | 2021-11-03 | 1 | -3/+4 |
| | | | | | | It didn't walk on visited grid but printed that as an iteration so it seemed like it did. | ||||
| * | Fix log-level usage in ffmpeg, update maze | Andinus | 2021-11-03 | 1 | -7/+7 |
| | | |||||
| * | Set ffmpeg verbosity | Andinus | 2021-11-03 | 1 | -9/+9 |
| | | |||||
| * | java/DFS: Fix out of bounds check | Andinus | 2021-11-03 | 1 | -4/+8 |
| | | |||||
| * | java/DFS: Chose neighbor randomly | Andinus | 2021-11-03 | 1 | -1/+9 |
| | | | | | | This does mean that we might end up taking a longer path but also the inverse! | ||||
| * | java/DFS: Keep variables in smallest scope | Andinus | 2021-11-03 | 1 | -6/+3 |
| | | |||||
| * | java/DFS: Output in Fornax format | Andinus | 2021-11-03 | 1 | -44/+47 |
| | | |||||
| * | java/DFS: Make output parseable | Andinus | 2021-11-02 | 1 | -21/+23 |
| | | |||||
| * | java/DFS: Move file to algorithms directory, cleanup | Andinus | 2021-10-16 | 1 | -0/+71 |