about summary refs log tree commit diff stats
path: root/algorithms
Commit message (Collapse)AuthorAgeFilesLines
* raku/DFS: Detect starting point, Tweak colors for GenerateFrameAndinus2021-11-241-1/+6
|
* java/BFS: Print according to fornax formatvamsee2021-11-191-11/+20
|
* Merge branch 'main' of https://github.com/andinus/fornaxvamsee2021-11-191-0/+124
|\
| * Copy neighbors subroutineAndinus2021-11-181-2/+57
| |
| * raku/DFS: Add DFS implementation in raku, Add input 06Andinus2021-11-171-0/+69
| |
* | java/BFS: Find final path for solutionvamsee2021-11-191-24/+70
|/
* java/DFS: Update to latest fornax format, fix DFSAndinus2021-11-161-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 codeAndinus2021-11-162-91/+95
|
* BFS code for maze traversalVam-c2021-11-051-0/+91
| | | errors (null) for start object.
* java/DFS: Don't walk on visited, Add DFS solutions, change colorsAndinus2021-11-031-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 mazeAndinus2021-11-031-7/+7
|
* Set ffmpeg verbosityAndinus2021-11-031-9/+9
|
* java/DFS: Fix out of bounds checkAndinus2021-11-031-4/+8
|
* java/DFS: Chose neighbor randomlyAndinus2021-11-031-1/+9
| | | | | This does mean that we might end up taking a longer path but also the inverse!
* java/DFS: Keep variables in smallest scopeAndinus2021-11-031-6/+3
|
* java/DFS: Output in Fornax formatAndinus2021-11-031-44/+47
|
* java/DFS: Make output parseableAndinus2021-11-021-21/+23
|
* java/DFS: Move file to algorithms directory, cleanupAndinus2021-10-161-0/+71