Shortest cycle through each node
In a weighted graph, find for every node the cost of the cheapest cycle that passes through it, or report that none exists. Only the title of this report was public; discuss the Dijkstra-based approach and its cost.
MicrosoftOnline assessmentNo answer yet. Write the first one; the best answer gets endorsed.