Interesting problem: given a graph, find out the minimum distance between any two nodes.
Input Description ----------------- On standard console input you will be given an integer N, followed by an Adjacency matrix. The graph is not directed, so the matrix will always be reflected about the main diagonal. Output Description ------------------ Print the radius of the graph as an integer.
There are a few ways to do this – you can run Dijkstra’s algorithm or Floyd-Warshall algorithm on the graph to find the path from each node to each other node. I sort of took a short cut – when the graph is represented as a matrix (as it is here), multiplying the matrix with itself (and adding the result to itself, so as not to lose the 0-step info) can be used as a way of checking whether or not two nodes are connected.
k steps, if
0 this means there is no path from
k steps. So if you repeat this multiplication and stop when there are no zero elements, the number of multiplication steps is the minimum distance you need.
[I’m a little bored of these daily programmer questions now :( I’ll do one more hard one and then find a new theme here.]