| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2020-09-26 | style: run cclang formatter | mo khan | |
| 2020-09-26 | Extract adjacency matrix into separate files | mo khan | |
| 2020-09-26 | feat: implement backtracking algorithm to visit each edge in both directions | mo khan | |
| 2020-09-26 | feat: work on algorithm to find path that traverses each edges in both ↵ | mo khan | |
| directions | |||
| 2020-09-08 | refactor: rename connected to has_edge | mo khan | |
| 2020-09-07 | test: add test to check if vertices are connected | mo khan | |
| 2020-09-07 | refactor: inline variable declarations | mo khan | |
| 2020-09-07 | feat: record edges in graph | mo khan | |
| 2020-09-07 | Ensure that 128 vertices can be added to graph | mo khan | |
| 2020-09-07 | feat: add vertex to graph | mo khan | |
| 2020-09-07 | feat: add function to init vertex | mo khan | |
| 2020-09-07 | test: add graph_tests to suite | mo khan | |
