Function dfs

kotlin/Graphs/BipartiteGraphValidation.kt:12–27

}

fun dfs(node: Int, color: Int, graph: List<List<Int>>, colors: IntArray): Boolean {
    colors[node] = color
    for (neighbor in graph[node]) {
        // If the current neighbor has the same color as the current
        // node, the graph is not bipartite.
        if (colors[neighbor] == color) {
            return false
        }
        // If the current neighbor is not colored, color it with the
        // other color and continue the DFS.
        if (colors[neighbor] == 0 && !dfs(neighbor, -color, graph, colors)) {
            return false
        }
    }
    return true
}