Skip to content

add graph iso tests #552

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

Merged
benlorenz merged 2 commits into from
Feb 10, 2026
Merged

add graph iso tests #552

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
016d0d0
add graph iso tests
benlorenz Feb 10, 2026
98b7127
bump version
benlorenz Feb 10, 2026
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
4 changes: 2 additions & 2 deletions Project.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
name = "Polymake"
uuid = "d720cf60-89b5-51f5-aff5-213f193123e7"
repo = "https://github.com/oscar-system/Polymake.jl.git"
version = "0.13.7"
version = "0.13.8"

[deps]
AbstractAlgebra = "c3fe647b-3220-5bb0-a1ea-a7954cac585d"
Expand Down Expand Up @@ -47,6 +47,6 @@ SparseArrays = "^1.10"
TOPCOM_jll = "~0.17.8"
julia = "^1.10"
lib4ti2_jll = "^1.6.10"
libpolymake_julia_jll = "~0.14.0"
libpolymake_julia_jll = "~0.14.5"
polymake_jll = "^400.1400.0"
polymake_oscarnumber_jll = "~0.3.9"
38 changes: 38 additions & 0 deletions test/graphs.jl
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -104,5 +104,43 @@
@test Polymake._shortest_path_dijkstra(g, em, 0, 1, true) == [0,1]
@test Polymake._shortest_path_dijkstra(g, em, 0, 1, false) == [0,4,3,2,1]
end
@testset verbose=true "graph isomorphism" begin
g = Polymake.Graph{Polymake.Directed}(7)
for i in 0:3
Polymake._add_edge(g, i, i+1)
end
Polymake._add_edge(g, 2, 5)
Polymake._add_edge(g, 2, 6)

gcf = Polymake._canonical_form(g)
@test Polymake._is_isomorphic(g, gcf)

perm = Polymake._canonical_perm(g, Polymake.Array{Int}(fill(1,7)))
gp = Polymake._permute_nodes(g, perm)
Polymake._permute_nodes!(g, perm)
for i in 0:6
for j in 0:6
@test Polymake._has_edge(gp, i, j) == Polymake._has_edge(gcf, i, j)
@test Polymake._has_edge(g, i, j) == Polymake._has_edge(gcf, i, j)
end
end

gs1 = Polymake.Graph{Polymake.Undirected}(3)
gs2 = Polymake.Graph{Polymake.Undirected}(3)
Polymake._add_edge(gs1, 0, 1)
Polymake._add_edge(gs2, 1, 2)

@test Polymake._is_isomorphic(gs1, gs2)
@test !Polymake._is_isomorphic_with_colors(gs1, Polymake.Array{Int}([1,2,3]), gs2, Polymake.Array{Int}([1,2,3]))
@test Polymake._is_isomorphic_with_colors(gs1, Polymake.Array{Int}([1,1,2]), gs2, Polymake.Array{Int}([2,1,1]))
@test Polymake._automorphisms(gs1) == [[1,0,2]]
@test Polymake._automorphisms(gs1, Polymake.Array{Int}([1,2,3])) == []

cubeg = Polymake.polytope.cross(2).GRAPH.ADJACENCY
crossg = Polymake.polytope.cube(2).GRAPH.ADJACENCY
@test Polymake._canonical_hash(cubeg, 42) == Polymake._canonical_hash(crossg, 42)
@test Polymake._canonical_hash(cubeg, Polymake.Array{Int}([1,1,1,1]), 42) == Polymake._canonical_hash(crossg, Polymake.Array{Int}([1,1,1,1]), 42)
@test Polymake._canonical_hash(cubeg, 42) != Polymake._canonical_hash(g, 42)
end
end

Loading