다익스트라 알고리즘
class Graph { int[,] adj = new int[6, 6] { { -1, 15, -1, 35, -1, -1 }, { 15, -1, 05, 10, -1, -1 }, { -1, 05, -1, -1, -1, -1 }, { 35, 10, -1, -1, 05, -1 }, { -1, -1, -1, 05, -1, 05 }, { -1, -1, -1, -1, 05, -1 } }; public void Dijikstra(int start) { bool[] visited = new bool[6]; int[] distance = new int[6]; int[] parent = new int[6]; Array.Fill(distance, Int32.MaxValue); distance[start] = 0; paren..