warrence/grapherity
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Release 0.3.0 #8

Merged
warrence merged 69 commits from release-0.3.0 into main 2026-10-15 10:06:13 +02:00
Conversation 0 Commits 69 Files Changed 34
+10
1 changed files with 10 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit 1979d33649 - Show all commits
src/testing/fixtures.rs
+10
View File
@@ -37,6 +37,8 @@ impl<G: GraphTopologyAddition> MakeTestGraph for G {
[Vec<Incidence<Self::Vertex, Self::Edge>>; 10], [Vec<Incidence<Self::Vertex, Self::Edge>>; 10],
) { ) {
let mut graph = Self::default(); let mut graph = Self::default();
graph.reserve_vertices(10);
graph.reserve_edges(18);
let vertices = core::array::from_fn(|_| graph.add_vertex()); let vertices = core::array::from_fn(|_| graph.add_vertex());
let edges = [ let edges = [
(vertices[0], vertices[1]), (vertices[0], vertices[1]),
@@ -121,6 +123,7 @@ impl<G: GraphTopologyAddition> MakeTestGraph for G {
fn single_edge() -> (Self, [Self::Vertex; 2], Self::Edge) { fn single_edge() -> (Self, [Self::Vertex; 2], Self::Edge) {
let mut graph = Self::default(); let mut graph = Self::default();
graph.reserve_vertices(2);
let vertices = core::array::from_fn(|_| graph.add_vertex()); let vertices = core::array::from_fn(|_| graph.add_vertex());
let e = graph.add_edge(vertices[0], vertices[1]); let e = graph.add_edge(vertices[0], vertices[1]);
(graph, vertices, e) (graph, vertices, e)
@@ -128,6 +131,7 @@ impl<G: GraphTopologyAddition> MakeTestGraph for G {
fn disconnected() -> (Self, [Self::Vertex; 3]) { fn disconnected() -> (Self, [Self::Vertex; 3]) {
let mut graph = Self::default(); let mut graph = Self::default();
graph.reserve_vertices(3);
let vertices = core::array::from_fn(|_| graph.add_vertex()); let vertices = core::array::from_fn(|_| graph.add_vertex());
graph.add_edge(vertices[1], vertices[2]); graph.add_edge(vertices[1], vertices[2]);
(graph, vertices) (graph, vertices)
@@ -142,6 +146,8 @@ impl<G: GraphTopologyAddition> MakeTestGraph for G {
fn multiple_edges<const K: usize>() -> (Self, [Self::Vertex; 2], [Self::Edge; K]) { fn multiple_edges<const K: usize>() -> (Self, [Self::Vertex; 2], [Self::Edge; K]) {
let mut graph = Self::default(); let mut graph = Self::default();
graph.reserve_vertices(2);
graph.reserve_edges(K);
let vertices = core::array::from_fn(|_| graph.add_vertex()); let vertices = core::array::from_fn(|_| graph.add_vertex());
let edges = core::array::from_fn(|_| graph.add_edge(vertices[0], vertices[1])); let edges = core::array::from_fn(|_| graph.add_edge(vertices[0], vertices[1]));
(graph, vertices, edges) (graph, vertices, edges)
@@ -149,6 +155,8 @@ impl<G: GraphTopologyAddition> MakeTestGraph for G {
fn two_edge_path() -> (Self, [Self::Vertex; 3], [Self::Edge; 2]) { fn two_edge_path() -> (Self, [Self::Vertex; 3], [Self::Edge; 2]) {
let mut graph = Self::default(); let mut graph = Self::default();
graph.reserve_vertices(3);
graph.reserve_edges(2);
let vertices = core::array::from_fn(|_| graph.add_vertex()); let vertices = core::array::from_fn(|_| graph.add_vertex());
let edges = core::array::from_fn(|i| graph.add_edge(vertices[i], vertices[i + 1])); let edges = core::array::from_fn(|i| graph.add_edge(vertices[i], vertices[i + 1]));
(graph, vertices, edges) (graph, vertices, edges)
@@ -156,6 +164,8 @@ impl<G: GraphTopologyAddition> MakeTestGraph for G {
fn two_edge_path_with_loops() -> (Self, [Self::Vertex; 3], [Self::Edge; 4]) { fn two_edge_path_with_loops() -> (Self, [Self::Vertex; 3], [Self::Edge; 4]) {
let mut graph = Self::default(); let mut graph = Self::default();
graph.reserve_vertices(3);
graph.reserve_edges(4);
let vertices = core::array::from_fn(|_| graph.add_vertex()); let vertices = core::array::from_fn(|_| graph.add_vertex());
// Path edges. // Path edges.
let e0 = graph.add_edge(vertices[0], vertices[1]); let e0 = graph.add_edge(vertices[0], vertices[1]);