완료됨
Dijkstra – Shortest Path Cost
"Dijkstra – Shortest Path Cost" 부분이 None을 두 번 출력하는건 의도된 사항인가요?
"Kosaraju – Strongly-Connected Components" 부분도 검증이 정확한지 확인 부탁드립니다!!
#misc
답변
1
I apologize for the confusion. In the Dijkstra implementation, I accidentally printed the result twice by writing
print(dijkstra(nodes, edges))
when it should simply have been
dijkstra(nodes, edges)
As for Kosaraju, my original problem description was unclear and didn’t specify the required output format—please see the updated local files for the exact format.