ALGORITHM FOR BREADTH FIRST SEARCH IN A GRAPH

BREADTH FIRST SEARCH IN A GRAPH

ALGORITHM FOR BREADTH FIRST SEARCH IN A GRAPH 

have a hashmap to add visited nodes
have a queue to keep visited nodes

start from the root node
add root to visited
push root to queue

for queue is not empty

    pop node from queue
    process the node

    check for neighbours of the node

    if neighbour not visited already
        add to visited
        push to queue

    if not visited
        continue


#Go Code 

                    queue := new(Queue)
                    visited := make(map[string]bool)                

                    for queue.Length != 0 {
                        node := queue.pop
                        process(node)

                        for id, conn := range node.Connections {
                            if !visited[id] {
                                visited[id] = true
                                queue.Push(node)
                            }
                        }
                    }