Edge List to Adjacency List

Print the adjacency list of an undirected graph: for each node 1..n print 'node: neighbours' with neighbours in increasing order (nothing after the colon if none).

1 <= n <= 1000