1. A method to determine one or more shortest paths through a portion of a computer network from a source vertex to one or more destination vertices according to a link-state protocol, comprising: processing a graph representation of the network portion, the graph representation including nodes and edges representing the vertices and connections therebetween, respectively wherein the processing includes operating on the graph representation according to a Djkstra-like algorithm, a subset of the Djkstra-like algorithm processing includes candidate list processing, to maintain and operate upon a candidate list of nodes that have been visited in the Djkstra-like algorithm processing; and the candidate list processing is optimized relative to standard Djkstra algorithm processing for the link-state protocol.