Virus Spread in Network

You are given an undirected network (graph) with n nodes labeled 0 … n-1 and a list of edges. Some nodes are initially infected by a virus. Every minute, each newly infected node passes the virus to every neighbor that is not yet infected. The process continues until no new nodes can be infected.

Write a function that receives:

• an integer n (total number of nodes),
• a list of undirected edges, each edge given as a pair [u, v], and
• a list of integers initial (the indices of the nodes that are infected at time 0).

Your function must return the list of all nodes that are ever infected, sorted in ascending order.