Skip to content

failing test case for preorder dft with int vertices #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
jlgeering wants to merge 2 commits into
base: master
Choose a base branch
from
Open

failing test case for preorder dft with int vertices #10

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
acc93fc
failing test case for preorder dft with int vertices
jlgeering Oct 16, 2017
47c190b
same issue with atoms
jlgeering Oct 16, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions test/reducer_test.exs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,6 +17,28 @@ defmodule Graph.Reducer.Test do
assert ^expected = Graph.Reducers.Dfs.map(g, fn v -> v end)
end

test "depth-first (preorder) with edge {:b, :a}" do
g = Graph.new
|> Graph.add_vertices([:b, :a])
|> Graph.add_edge(:b, :a)

expected = [:b, :a]
assert ^expected = Graph.Reducers.Dfs.map(g, fn v -> v end)
# NB the same applies to the preorder function
# assert ^expected = Graph.preorder(g)
end

test "first node of depth-first (preorder) with edge {1, 8000}" do
g = Graph.new
|> Graph.add_vertices([1, 8000])
|> Graph.add_edge(1, 8000)

expected = [1, 8000]
assert ^expected = Graph.Reducers.Dfs.map(g, fn v -> v end)
# NB the same applies to the preorder function
# assert ^expected = Graph.preorder(g)
end

test "can walk a graph breadth-first" do
g = Graph.new
|> Graph.add_vertices([:a, :b, :c, :d, :e, :f, :g])
Expand Down