internal void EnumerateEdges(GraphParameter <Graph> p) { Graph graph = p.Graph; // Arrange int source = graph.VertexCount >> 1; byte[] setBackingStore = ArrayPool <byte> .Shared.Rent(Math.Max(graph.VertexCount, source + 1)); Array.Clear(setBackingStore, 0, setBackingStore.Length); IndexedSet exploredSet = new(setBackingStore); // Act IEnumerator <Endpoints> basicSteps = Dfs.EnumerateEdges(graph, source, graph.VertexCount) !; IEnumerator <Endpoints> enumerableSteps = EnumerableDfs.EnumerateEdges(graph, source, exploredSet) !; // Assert while (true) { bool expectedHasCurrent = enumerableSteps.MoveNext(); bool actualHasCurrent = basicSteps.MoveNext(); Assert.Equal(expectedHasCurrent, actualHasCurrent); if (!expectedHasCurrent || !actualHasCurrent) { break; } Endpoints expected = enumerableSteps.Current; Endpoints actual = basicSteps.Current; if (expected != actual) { Assert.Equal(expected, actual); break; } } }