Initial release #1

2026-06-30T10:21:53+02:00

warrence commented

2026-06-30 10:21:53 +02:00

No description provided.

warrence added 101 commits 2026-06-30 10:21:53 +02:00

Add cargo init files e07389aed8

Add experimental Graph implementation 2e72de2281

Add RustRover files b85edb1287

Fix are_adjacent() method 58f330ef46

Next incidence was not updated correctly, which could lead to bad results and infinite loops.

Add Graph example test 5a1080783c

Rename Graph.vertex_incidence_headers to "incidence_headers" e518d72a9e

Reformat code with rustfmt 04c9150172

Add basic Dijkstra algorithm with test in main() 2a35c47ad4

Update test assertions in main() 5bf723928b

Update todo e879316a4c

Add todos 43974d6754

Add success message at the end of main() 46675a1246

Add "algorithms" and "models" modules for existing code and related todos 720f497b64

Add todo 679b597f92

Add Graph::new() 66e1498c76

Update todos a4ed7ea44e

Move main() code into tests and remove binary crate bff8ca6857

Add iterator over vertices Graph::iter() 0826e140b8

Add iterator over neighbors of a vertex Graph::neighbors() dd76355a70

Rename Graph::iter() to Graph::vertices() 72d3c06f1e

Add tests for Graph::vertices() 74ca390ac2

Add tests for Graph::neighbors() a26b0eba8c

Update vertex iterator tests 6ff02f8c67

Add tests for some trivial graphs 50f3a150bb

Update Graph::are_adjacent() to use neighbors() iterator 761920b2c0

Add todo 149db22fe8

Update Dijkstra's algorithm to use Graph::neighbors() iterator 64d0302d64

Add tests for Dijkstra's algorithm on trivial graphs 5ad480b379

Remove pub from structs and fields that should have been private 3565b6b548

Graph fields can now be private because of the new iterators Graph::vertices()
and Graph::neighbors(). Without them there was no way to access vertices and
incidences without the public Graph fields.

Add tests for loops and multiple edges c5a0f2a3f6

Combine next_incidences and incidence_vertices of Graph into one, and rename incidence_headers to vertices 489ed6d506

Add GraphTopology trait and use it to interface graph model with algorithm da9ba7b0ad

Add edge return type to GraphTopology::add_edge() 9088dd4683

There is currently no use for the return type, but it will come.

Rename Graph to AppendGraph for future other graph models ab830ed221

Add test for add_edge() return value 41f2332735

Add DijkstraResult return type instead of unnamed tuple a250bde626

Add Dijkstra variant without returning predecessors a939f9b889

Move AppendGraph to its own module ee26b7a3e0

Fix formatting d0cbebcae0

Add Graph as a straight copy of AppendGraph 8126352c9b

Add new GraphTopologyDeletion trait for Graph to implement b54800c1be

Add Default implementation for AppendGraph eabde7d635

Fix AppendGraph unit tests 6180786e33

Fix several minor issues in AppendGraph::are_adjacent(), unit tests, and formatting 02cd1a0dea

Fix same issues in Graph draft as well 67e16f50cd

Change GraphTopology implementation for Graph with generational arena 37a911dce0

Update todos 0a30307a0d

Add unit tests for GraphTopologyDeletion for Graph a8168b35e4

Add and update todos 0ae4d486cb

Add comments for AppendGraph and Graph add_incidence() f075501828

Update and adds tests for Graph edge deletion 8e0b3325f5

Fix formatting ceedea6a0f

Add Graph::delete_edge() implementation 2793f8af8a

Fix Graph::delete_edge() for paired index with loops 5b0d6ca1ad

- Add new tests for this case
- Fix double list traversal for loop deletions
- Rename Graph::delete_incidence() to update_incidence_list(), and its arguments and local vars

Add test for Graph vertex deletion with loop b3dc0ea666

Add Graph::delete_vertex() implementation 09c5850ff3

Add graph topology test helper macros to deduplicate test code 8324f93ebd

Add loops and multi-edges to the test graph, fix neighbors() test feaca335b1

Add Copy and Eq traits to GraphTopology::Edge 18245b9955

Add test for GraphTopology::vertices() after delete c589095737

Add GraphTopology::edges() and tests 6e9867a65e

Add VertexMap to attach data to vertices f40c03b113

Update Dijkstra's algorithm to use VertexMap 166b91cdd2

Add VertexMap tests for Graph (vertex deletion) 7f91743b02

Update VertexMap tests to validate both graph models 016cece626

Move edge_count() in method order e074fdf944

Add EdgeMap and private generic EntityMap, update tests 6fe3acb306

Add weight parameter for Dijkstra's algorithm, add unweighted variants (unused) 726e7691ea

Change "neighbor" terminology to "adjacent vertex" throughout the code a7be995e34

Renamed the private graph iterators to attune for upcoming changes 4e47573290

Remove deprecated From<Vertex> for usize implementation d3fcd690a5

Add GraphTopology::incidences(), update and add related tests 0bcd270d12

Update Dijkstra's to use incidences instead of neighbors, and with it custom edge weights 0f5f0d67d2

Refactor AppendGraph iterators into one RawIncidenceIterator 2eb054eb0c

Refactor Graph iterator structs into private method used with std::iter::from_fn() 85e25ef0ca

Add GraphTopology::incident_vertices and tests f45fc98afc

Extracted some assert code for GraphTopology::incidences into new fn ac688b4fc0

Add incident vertices to edges return value in make_test_graph() fixture be63527478

Add len() for VertexMap and EdgeMap f1d5ccafd2

Move maps tests to integration tests ff148532ab

Fix format 6191def324

Add Graph::raw_incidences() iterator as a wrapper for step_incidence() 340fde2133

Fix inconsistent local var name in test function 384dca2d20

Add GraphTopology::incident_edges() and tests f862ac55ec

Add todo that was accidentally removed aaa1b34db3

Remove todo, proposed change would not affect callers e479074151

Update tests for Dijkstra's algorithm to test both graph models 600664acb6

Use the already established macro pattern, move actual tests to a new file in src/testing.
Use the make_test_graph() function from the graph topology tests instead of duplicating it for the Dijkstra tests.

Update test names for Dijkstra's algorithm to match the tested functions 13daf20e1c

This should have happened when the functions were renamed with the introduction of custom edge weights

Refactor Dijkstra test assertions into new functions 25b5d7864a

Add tests for Dijkstra's algorithm with edge weights 465a383683

Add trait imports to test functions, making macros self-contained ce692cb0b2

Add todo for custom weight type for Dijkstra's algorithm 3adfb4b9eb

Move the disconnected test graph to the more general graph_topology_test_fixtures macro e299012948

Add breadth-first search algorithms and tests 91ac925417

Add depth-first search algorithms and tests 135f256141

Update breadth-first search tests c147ed4974

Fix formatting c197766229

Add GraphTopology.incidence_cursor() for certain use-cases where the iterator is problematic f009a86f1e

Also add raw_incidences() and step_incidence() to AppendGraph analogously to
Graph, which allows to remove RawIncidenceIterator and simplify its call sites.

Add find_path algorithm and tests 21c95b4796

Update readme and license information fb64e370dc

Update cargo package metadata 6b742a53f5

warrence added 1 commit 2026-06-30 10:23:30 +02:00

Update cargo package metadata db79da7301

warrence merged commit 4f08eb453f into main

2026-06-30 10:26:52 +02:00

warrence deleted branch dev

2026-06-30 10:26:53 +02:00

Sign in to join this conversation.