unable to get the binding for 'SnodeDistanceKKHeuristic <: AbstractDistance' in `@docs` block in docs/src/reference.md:122-155 from expression ':(SnodeDistanceKKHeuristic <: AbstractDistance)' in module SimpleDirectedHypergraphs ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ``` exception = `binding` cannot understand expression `SnodeDistanceKKHeuristic <: AbstractDistance`.

no docs found for 'shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

no docs found for 'all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}}' in `@docs` block in docs/src/reference.md:122-155 ```@docs _visit(h::H, v::Int) where {H <: AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(b::BipartiteView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} SimpleHypergraphs.shortest_path(t::TwoSectionView{H}, source::Int, target::Int) where {H<:AbstractDirectedHypergraph} forward_reachable(hg::H, source::Int) where {H<:AbstractDirectedHypergraph} backward_traceable(hg::H, target::Int) where {H<:AbstractDirectedHypergraph} is_reachable(hg::H, source::Int, target::Int, target_type::Symbol) where {H<:AbstractDirectedHypergraph} all_hyperpaths(hg::H, source::Int, target::Int) where {H <: AbstractDirectedHypergraph} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int) where {T<:Real,V,E,D<:AbstractDict{Int,T}} all_hyperpaths(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}) where {T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph, T <: Real} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_heuristic(hg::DirectedHypergraph{T, V, E, D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{T}) where {T <: Real, V, E, D <: AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::H, source::Int, target::Int, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph, T<:Real} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, source::Int, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, target::Int, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} shortest_hyperpath_kk_ilp(hg::DirectedHypergraph{T,V,E,D}, sources::Set{Int}, targets::Set{Int}, hyperedge_weights::AbstractVector{S}) where {S<:Real,T<:Real,V,E,D<:AbstractDict{Int,T}} SnodeDistanceKKHeuristic <: AbstractDistance SnodeDistanceKKILP <: AbstractDistance SimpleHypergraphs.distance(hg::H, distance_method::SnodeDistanceKKHeuristic, hyperedge_weights::AbstractVector{T}) where {H<:AbstractDirectedHypergraph,T<:Real} distance(hg::H, distance_method::SnodeDistanceKKILP, hyperedge_weights::AbstractVector{T}) where {H <: AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKHeuristic) where {H<:AbstractDirectedHypergraph} Graphs.diameter(hg::H, _::SnodeDistanceKKILP) where {H<:AbstractDirectedHypergraph} ```

The plotting functionality of HyperNetX will not work! Conda Python networkx not found. Conda Python HyperNetX not found. To test your installation try running `using PyCall;pyimport("networkx");pyimport("hypernetx")`