1129. Shortest Path with Alternating Colors

You are given an integer n, the number of nodes in a directed graph where the nodes are labeled from 0 to n - 1. Each edge is red or blue in this graph, and there could be self-edges and parallel edges. You are given two arrays redEdges and blueEdges where: - redEdges[i] = [ai, bi] indicates that there is a directed red edge from node ai to node bi in the graph, and - blueEdges[j] = [uj, vj] in