Remove ref

src/iterators/bfs.jl

@@ -1,7 +1,7 @@
 """
     BFSIterator
 
-`BFSIterator` is a subtype of [`VertexIterator`](@ref) to iterate through graph vertices using a breadth-first search. A source node(s) is optionally supplied as an `Int` or an array-like type that can be indexed if supplying multiple sources. If no source is provided, it defaults to the first vertex.
+`BFSIterator` is used to iterate through graph vertices using a breadth-first search. A source node(s) is optionally supplied as an `Int` or an array-like type that can be indexed if supplying multiple sources. If no source is provided, it defaults to the first vertex.
 
 # Examples
 ```julia-repl
@@ -36,10 +36,10 @@
     n_visited::Int
 end
 
 BFSIterator(g::AbstractGraph) = BFSIterator(g, first(vertices(g)))
 
 Base.IteratorSize(::Type{BFSIterator}) = Base.SizeUnknown()
 Base.eltype(::Type{BFSIterator}) = eltype(t.graph)
 
 """
     Base.iterate(t::BFSIterator)

src/iterators/dfs.jl

@@ -1,7 +1,7 @@
 """
     DFSIterator
 
-`DFSIterator` is a subtype of [`VertexIterator`](@ref) to iterate through graph vertices using a depth-first search. A source node(s) is optionally supplied as an `Int` or an array-like type that can be indexed if supplying multiple sources. If no source is provided, it defaults to the first vertex.
+`DFSIterator` is used to iterate through graph vertices using a depth-first search. A source node(s) is optionally supplied as an `Int` or an array-like type that can be indexed if supplying multiple sources. If no source is provided, it defaults to the first vertex.
 
 # Examples
 ```julia-repl
@@ -34,10 +34,10 @@
     queue::Vector{Int}
 end
 
 DFSIterator(g::AbstractGraph) = DFSIterator(g, first(vertices(g)))
 
 Base.IteratorSize(::Type{DFSIterator}) = Base.SizeUnknown()
 Base.eltype(::Type{DFSIterator}) = eltype(t.graph)
 
 """
     Base.iterate(t::DFSIterator)