has_path.jl

function has_path(g::AbstractGraph, u::Integer, v::Integer; exclude_vertices::AbstractVector=Vector{eltype(g)}())
    T = eltype(g)
    seen = falses(nv(g))
    next = Vector{T}()
    push!(next, u)
    excludeset = Set(exclude_vertices)
    while !isempty(next)
        src = shift!(next) #Get first element
        src in excludeset && continue
        vertexneighbors = neighbors(g, src)
        for vertex in vertexneighbors
            
            if vertex == v
                return true
            end
            #If not already set, and is not found in the queue.
            if !seen[vertex]
                push!(next, vertex) #Push onto queue
                seen[vertex] = true
            end
        end
    end
    return false
end