Commit graph

11 commits

Author SHA1 Message Date
Simon Bruder 63431b6824 u01: Add test case for very short loop
This actually worked, but it is nice to have it verified nonetheless.
2023-05-09 23:25:04 +02:00
Simon Bruder 5ce178b914 u01/tests: Fix typo 2023-05-09 23:25:04 +02:00
Simon Bruder a4e9c4abda Licence under GPL v3 or later 2023-05-09 23:25:04 +02:00
Simon Bruder ffc4c3e6dd u01: Add iterative print with cycle detection 2023-04-22 13:47:57 +02:00
Simon Bruder 1f56b00800 u01: Add recursive print with cycle detection 2023-04-22 13:47:57 +02:00
Simon Bruder 5ac5bd1f43 u01: Add stream output to node 2023-04-22 13:47:57 +02:00
Simon Bruder 6a7c1c4546 u01/tests: Simplify create complete tree 2023-04-22 13:47:53 +02:00
Simon Bruder 3e63e632b7 u01: Add complete tree creation 2023-04-22 13:47:41 +02:00
Simon Bruder 8ea29904ea u01/tests: Extract get_node_id function 2023-04-22 13:47:41 +02:00
Simon Bruder c2804e2d3b u01: Implement global node counting
The test is not very pretty, I may think of something nicer (once I
learn how to do it).
2023-04-22 13:47:41 +02:00
Simon Bruder 48cfafc9a3 u01: Init 2023-04-22 13:47:40 +02:00