I have a graph data structure that represents a rail network. The nodes of the network are the train stations and the edges are the connections between stations.
Running PageRank on this graph gives me a way to rank the stations by importance. But I want to rank the connections between stations, the edges of the graph, by importance.
Is there an appropriate algorithm to do this? Is there a way to reformat the graph so that I can run PageRank for edges?