fixed exisintg identifier issue

src/Graphs.jl

@@ -183,7 +183,7 @@ export
 is_cyclic, topological_sort_by_dfs, dfs_tree, dfs_parents,
 
 # iterators
-DFS, BFS, iterate,
+DFSIterator, BFSIterator, iterate,
 
     # random
     randomwalk,

src/traversals/iterators.jl

@@ -1,22 +1,24 @@
 """
-    abstract type TraversalAlgorithm
+    abstract type IteratorAlgorithm
 
-`TraversalAlgorithm` is an abstract type which specifies using depth-first traversal [`DFS`](@ref) or breadth-first traversal [`BFS`](@ref).
+`IteratorAlgorithm` is an abstract type which specifies using depth-first traversal [`DFSIterator`](@ref) or breadth-first traversal [`BFSIterator`](@ref).
 """
-abstract type TraversalAlgorithm end
+abstract type IteratorAlgorithm end
 
 
 """
-    struct DFS <: TraversalAlgorithm
+    struct DFSIterator <: IteratorAlgorithm
 
 `DFS` is a struct which specifies using depth-first traversal to iterate through a graph. A source node must be supplied to construct this iterator as `DFS(g::AbstractGraph, source::Int)`.
 
+`DFSIterator` is a struct which specifies using depth-first traversal to iterate through a graph. A source node must be supplied to construct this iterator as `DFSIterator(g::AbstractGraph, source::Int)`.
+
 # Examples
 ```julia-repl
 julia> g = smallgraph(:house)
 {5, 6} undirected simple Int64 graph
 
-julia> for node in DFS(g, 1)
+julia> for node in DFSIterator(g, 1)
            display(node)
        end
 1
@@ -26,14 +28,14 @@ julia> for node in DFS(g, 1)
 5
 ```
 """
-struct DFS <: TraversalAlgorithm
+struct DFSIterator <: IteratorAlgorithm
     graph::AbstractGraph
     source::Int
 end
 
 
 """
-    struct BFS <: TraversalAlgorithm
+    struct BFSIterator <: IteratorAlgorithm
 
 `BFS` is a struct which specifies using breadth-first traversal to iterate through a graph. A source node must be supplied to construct this iterator as `BFS(g::AbstractGraph, source::Int)`.
 
@@ -42,7 +44,7 @@ end
 julia> g = smallgraph(:house)
 {5, 6} undirected simple Int64 graph
 
-julia> for node in BFS(g, 1)
+julia> for node in BFSIterator(g, 1)
            display(node)
        end
 1
@@ -52,7 +54,7 @@ julia> for node in BFS(g, 1)
 5
 ```
 """
-struct BFS <: TraversalAlgorithm
+struct BFSIterator <: IteratorAlgorithm
     graph::AbstractGraph
     source::Int
 end
@@ -70,11 +72,11 @@ end
 
 
 """
-    Base.iterate(t::TraversalAlgorithm)
+    Base.iterate(t::IteratorAlgorithm)
 
 First iteration to visit each node.
 """
-function Base.iterate(t::TraversalAlgorithm)
+function Base.iterate(t::IteratorAlgorithm)
     visited = falses(nv(t.graph))
     visited[t.source] = true
     state = GraphIteratorState(visited, [t.source])
@@ -83,11 +85,11 @@ end
 
 
 """
-    Base.iterate(t::DFS, state::GraphIteratorState)
+    Base.iterate(t::DFSIterator, state::GraphIteratorState)
 
 Iterator to visit each node in a depth-first manner.
 """
-function Base.iterate(t::DFS, state::GraphIteratorState)
+function Base.iterate(t::DFSIterator, state::GraphIteratorState)
     while !isempty(state.queue)
         for node in outneighbors(t.graph, state.queue[end])
             if !state.visited[node]
@@ -102,11 +104,11 @@ function Base.iterate(t::DFS, state::GraphIteratorState)
 end
 
 """
-    Base.iterate(t::BFS, state::GraphIteratorState)
+    Base.iterate(t::BFSIterator, state::GraphIteratorState)
 
 Iterator to visit each node in a breadth-first manner.
 """
-function Base.iterate(t::BFS, state::GraphIteratorState)
+function Base.iterate(t::BFSIterator, state::GraphIteratorState)
     while !isempty(state.queue)
         for node in outneighbors(t.graph, state.queue[1])
             if !state.visited[node]

test/traversals/iterators.jl

@@ -4,10 +4,10 @@
     add_edge!(g,3,1)
     add_edge!(g,4,7)
 
-    @testset "DFS" begin
+    @testset "DFSIterator" begin
         for g in testgraphs(g)
             nodes_visited = fill(0, nv(g))
-            for (i, node) in enumerate(DFS(g, 6))
+            for (i, node) in enumerate(DFSIterator(g, 6))
                 nodes_visited[i] = node
             end
             @test nodes_visited[1:2] == [6, 3]
@@ -30,10 +30,10 @@
         end
     end
 
-    @testset "BFS" begin
+    @testset "BFSIterator" begin
         for g in testgraphs(g)
             nodes_visited = fill(0, nv(g))
-            for (i, node) in enumerate(BFS(g, 6))
+            for (i, node) in enumerate(BFSIterator(g, 6))
                 nodes_visited[i] = node
             end
             @test nodes_visited[1] == 6