Function dfs

critical_connections_in_a_network_1192/solution.go:37–70

(node int, adjList map[int][]int, disc, low, parents []int, time int, critical [][]int)

}

func dfs(node int, adjList map[int][]int, disc, low, parents []int, time int, critical [][]int) [][]int {
	time++
	disc[node] = time
	low[node] = time

	// for every node in the adjacency list, dfs
	for _, edge := range adjList[node] {
		parents[edge] = node

		// if we have not seen the node over the edge before
		if disc[edge] == -1 {
			critical = dfs(edge, adjList, disc, low, parents, time, critical)

			// compare the low values of both nodes to update the current
			// nodes connectivity to the earliest node possible
			low[node] = int(math.Min(float64(low[node]), float64(low[edge])))

			// the edge is a bridge if the low of the edge is
			// greater than the discovery time of the node
			if low[edge] > disc[node] {
				critical = append(critical, []int{node, edge})
			}
		}

		// if we have seen the node before and it's not the parent
		if edge != parents[node] {
			// check if node is connected to any earlier nodes
			// if so, set the low for node to the edge discovered the earliest
			low[node] = int(math.Min(float64(disc[edge]), float64(low[node])))
		}
	}

	return critical
}