about summary refs log tree commit diff stats
Commit message (Collapse)AuthorAgeFilesLines
* Set default crf to 24Andinus2021-11-181-1/+1
| | | | | | | | | | | From https://trac.ffmpeg.org/wiki/Encode/H.265: The default is 28, and it should visually correspond to libx264 video at CRF 23, but result in about half the file size. This will result in larger videos. Maybe the default should be libx265. I did try it, results in smaller videos but I wasn't able to play the video on Firefox.
* Set stop duration to 2 secondsAndinus2021-11-181-1/+1
|
* Add basic test for Fornax::GenerateFrameAndinus2021-11-181-1/+2
|
* Add GenerateFrame to META6.json, update versionAndinus2021-11-181-2/+3
|
* Move frame generation to a module, update progress reportingAndinus2021-11-182-100/+123
|
* Update README structure, Add bugsAndinus2021-11-182-64/+78
|
* Copy neighbors subroutineAndinus2021-11-181-2/+57
|
* Add usage instructionsAndinus2021-11-172-20/+43
|
* raku/DFS: Add DFS implementation in raku, Add input 06Andinus2021-11-172-0/+87
|
* Alias frame-rate to fpsAndinus2021-11-171-2/+2
| | | | Preserves backwards compatibility.
* Remove output option, rename frame-rate option to fpsAndinus2021-11-171-6/+6
|
* Remove output option, Define maze input format in READMEAndinus2021-11-172-77/+118
|
* Add DFS-60 demoAndinus2021-11-162-6/+14
|
* Add v0.1.1 release notes v0.1.1Andinus2021-11-162-1/+25
|
* Add note about incorrect visualizationAndinus2021-11-161-0/+5
|
* Add solution/DFS-60Andinus2021-11-161-0/+438
|
* Update to latest fornax formatAndinus2021-11-161-21/+33
|
* 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.
* Update fornax format to include start and current pathAndinus2021-11-162-6/+12
|
* java/BFS: Prettify codeAndinus2021-11-162-91/+95
|
* Add new demo links, link to latest writingAndinus2021-11-092-7/+17
|
* Add more solutions, add note about DFS-51Andinus2021-11-094-0/+1352
|
* BFS code for maze traversalVam-c2021-11-051-0/+91
| | | errors (null) for start object.
* Wait 4s on last frame, use awaitAndinus2021-11-041-1/+2
|
* Wait for jobs to finish before creating the slideshowAndinus2021-11-041-0/+2
|
* Process iterations in parallelAndinus2021-11-041-52/+62
|
* Add option to skip generating slideshow, use random directoryAndinus2021-11-041-7/+18
|
* Fix cgit linkAndinus2021-11-032-2/+2
|
* Release v0.1.0 v0.1.0Andinus2021-11-032-4/+6
|
* Update install instructionAndinus2021-11-033-2/+3
|
* Add Hex2RGB module in META6.jsonAndinus2021-11-031-1/+2
|
* Add testsAndinus2021-11-032-0/+14
|
* Document optionsAndinus2021-11-032-0/+15
|
* Add installation notes to READMEAndinus2021-11-032-10/+115
|
* Add News section in READMEAndinus2021-11-032-29/+48
|
* Add Demo VideoAndinus2021-11-032-7/+50
|
* java/DFS: Don't walk on visited, Add DFS solutions, change colorsAndinus2021-11-034-9/+57
| | | | | 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-032-8/+8
|
* More DFS solutionsAndinus2021-11-032-0/+55
|
* Set ffmpeg verbosityAndinus2021-11-032-10/+12
|
* Rename sample solutionsAndinus2021-11-037-0/+0
| | | | When we add more algorithms, this'll make it easier to browse.
* More DFS solutionAndinus2021-11-031-0/+1995
|
* Fix excess space calculationAndinus2021-11-031-2/+2
| | | | Earlier we assumed that rows == columns.
* java/DFS: Fix out of bounds checkAndinus2021-11-031-4/+8
|
* More sample solutionsAndinus2021-11-035-0/+242
|
* 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
|
* Change default output directoryAndinus2021-11-032-4/+4
|
* Add sample DFS solutionAndinus2021-11-032-1/+7
|
* Variable frame rate, center the canvasAndinus2021-11-031-8/+15
|