| Program | Source File | Description |
|---|---|---|
| dag_example | dag_example.f90 | DAG module test program. |
| dsm_test | dsm_test.f90 | This is a test program for subroutines dsm and fdjs. the test data represents a neutron kinetics problem. |
| main | lsqrtest.f90 | Main program for tests. |
| main | lusol_test.f90 | Main program for EZ test. |
| main | lsqrtest_ez.f90 | Main program for EZ test. |
| nlesolver_test_1 | nlesolver_test_1.f90 | Test of a small, square ( |
| problem_1 | problem_01.f90 | |
| problem_10 | problem_10.f90 | |
| problem_11 | problem_11.f90 | |
| problem_12 | problem_12.f90 | |
| problem_12b | problem_12b.f90 | completely reworked solution from part a this one starts with the int list and checks it against the pattern. it also employs a function cache to speed it up. |
| problem_13 | problem_13.f90 | |
| problem_15 | problem_15.f90 | |
| problem_16 | problem_16.f90 | |
| problem_17 | problem_17.f90 | Based on AOC 2021 Day 15: https://github.com/jacobwilliams/AoC-2021/blob/master/test/problem_15.f90 see: https://en.wikipedia.org/wiki/Dijkstra's_algorithm#Pseudocode |
| problem_17 | problem_17b.f90 | part b |
| problem_18 | problem_18.f90 | |
| problem_19 | problem_19.f90 | |
| problem_19b | problem_19b.f90 | reformulated to operate on ranges of the x,m,a,s ratings |
| problem_2 | problem_02.f90 | |
| problem_21 | problem_21.f90 | |
| problem_22 | problem_22.f90 | |
| problem_23 | problem_23.f90 | alternate one... collapse the maze into a graph |
| problem_25 | problem_25.f90 | |
| problem_3 | problem_03.f90 | |
| problem_4 | problem_04.f90 | |
| problem_5 | problem_05.f90 | |
| problem_6 | problem_06.f90 | |
| problem_7 | problem_07.f90 | |
| problem_8 | problem_08.f90 | |
| problem_9 | problem_09.f90 | |
| sparse_test | sparse_test.f90 | Test of a sparse problem. |
| test | test.f90 | Tests for fmin_module. |
| test1 | test1.f90 | Test1 for the numerical differentiation module. |
| test2 | test2.f90 | Test2 for the numerical differentiation module. Makes a plot of the errors using different methods and step sizes. |