Delete comment

zabio3 · zabio3 · commit ecf95c6a9ed0 · 2017-11-15T14:24:33.000+09:00
diff --git a/Dijkstras.scala b/Dijkstras.scala
@@ -66,7 +66,7 @@ case class SimpleGraph[N](succs: Map[N, Map[N, Int]]) {
     var unreachedVertexSet:Set[N] = succs.keySet.filterNot(_ == start)
     while (!unreachedVertexSet.isEmpty) {
       currentDistance = updateGraph(start)(nextNode)(currentDistance)
-      nextNode = shortestPath(start)(succs.keySet.filterNot(unreachedVertexSet.contains(_)))(currentDistance) // 次のノードを決定させる
+      nextNode = shortestPath(start)(succs.keySet.filterNot(unreachedVertexSet.contains(_)))(currentDistance)
       unreachedVertexSet = unreachedVertexSet.-(nextNode)
     }
     println(currentDistance(finish)._2.reverse.toSeq)

Original file line number	Diff line number	Diff line change
`@@ -66,7 +66,7 @@ case class SimpleGraph[N](succs: Map[N, Map[N, Int]]) {`
`66`	`66`	`var unreachedVertexSet:Set[N] = succs.keySet.filterNot(_ == start)`
`67`	`67`	`while (!unreachedVertexSet.isEmpty) {`
`68`	`68`	`currentDistance = updateGraph(start)(nextNode)(currentDistance)`
`69`		`- nextNode = shortestPath(start)(succs.keySet.filterNot(unreachedVertexSet.contains(_)))(currentDistance) // 次のノードを決定させる`
	`69`	`+ nextNode = shortestPath(start)(succs.keySet.filterNot(unreachedVertexSet.contains(_)))(currentDistance)`
`70`	`70`	`unreachedVertexSet = unreachedVertexSet.-(nextNode)`
`71`	`71`	`}`
`72`	`72`	`println(currentDistance(finish)._2.reverse.toSeq)`