Find the shortest paths to other vertices
dijkstra_nodes(dist, src, node_costs)A matrix of distances between nodes
An integer vertex ID
a list of costs, in order, of all nodes represented in the sociomatrix, all are assumed 0 if unspecified
A numeric vector, entry i of which is the vertex immediately preceeding vertex i in the shortest path leading to i. Full paths must be constructed recursively.