kucherenko__jscpd/fixtures/go/file2.go

package bfs

import (
  "github.com/arnauddri/algorithms/algorithms/graphs/bfs"
  "github.com/arnauddri/algorithms/data-structures/graph"
)

func ShortestPath(g *graph.DirGraph, start graph.VertexId) (dist map[graph.VertexId]int) {
  dist = make(map[graph.VertexId]int)
  visited := make(map[graph.VertexId]bool)

  getDist := func(v graph.VertexId) {
    neighbours := g.GetNeighbours(v).VerticesIter()
    visited[v] = true

    for neighbour := range neighbours {

      ok, _ := visited[neighbour]
      if !ok {
        dist[neighbour] = dist[v] + 1
      }
    }
  }

  bfs.Bfs(g, start, getDist)

  return
}


func test() {
  return
}