Anybody can write me this programme? Unfortunatelly I cannot solve it:
"Write a program that reads in an adjacency list (unordered) from a file ( barabasi.in) of a simple undirected graph.
We can assume there are less then 1000 nodes and 10000 edges.
The output should be the second neighbours of the 0 indexed node. (one in each line)
A solution for example is 'barabasi.out'"
Thanks