Given a directed graph with n nodes and a list of directed edges [u, v] (an edge from u to v), perform a breadth-first search from a given start node, always following out-neighbors in ascending order. Return the order in which nodes are first visited as an array. The input is JSON {n, edges, start}.
Input: JSON {n, edges, start}.
Output: Array — the BFS visitation order.
Input: {"n":5,"edges":[[0,1],[0,2],[1,3],[2,4]],"start":0}
Output: [0,1,2,3,4]
Explanation: Following directed edges.Input: {"n":3,"edges":[[0,1],[1,2]],"start":1}
Output: [1,2]
Explanation: Cannot reach 0 from 1.Input: {"n":1,"edges":[],"start":0}
Output: [0]
Explanation: Single node.1<=n<=10^5directed0<=start<n