examples: remove empty comments (#14986)

emirhanyener · web-flow · commit 1a49db4ea131 · 2022-07-08T15:35:45.000+03:00
diff --git a/examples/graphs/dijkstra.v b/examples/graphs/dijkstra.v
@@ -85,7 +85,7 @@ fn departure_priority<T>(mut prior_queue []T) int {
 // give a NODE v, return a list with all adjacents
 // Take care, only positive EDGES
 fn all_adjacents<T>(g [][]T, v int) []int {
-	mut temp := []int{} //
+	mut temp := []int{}
 	for i in 0 .. (g.len) {
 		if g[v][i] > 0 {
 			temp << i
@@ -147,7 +147,7 @@ fn dijkstra(g [][]int, s int) {
 			if dist[w] > new_dist {
 				dist[w] = new_dist
 				updating_priority(mut pq_queue, w, dist[w])
-				path[w] = v //
+				path[w] = v
 			}
 		}
 	}
diff --git a/examples/graphs/minimal_spann_tree_prim.v b/examples/graphs/minimal_spann_tree_prim.v
@@ -81,7 +81,7 @@ fn departure_priority<T>(mut prior_queue []T) int {
 // give a NODE v, return a list with all adjacents
 // Take care, only positive EDGES
 fn all_adjacents<T>(g [][]T, v int) []int {
-	mut temp := []int{} //
+	mut temp := []int{}
 	for i in 0 .. (g.len) {
 		if g[v][i] > 0 {
 			temp << i

Original file line number	Diff line number	Diff line change
`@@ -85,7 +85,7 @@ fn departure_priority<T>(mut prior_queue []T) int {`
`85`	`85`	`// give a NODE v, return a list with all adjacents`
`86`	`86`	`// Take care, only positive EDGES`
`87`	`87`	`fn all_adjacents<T>(g [][]T, v int) []int {`
`88`		`- mut temp := []int{} //`
	`88`	`+ mut temp := []int{}`
`89`	`89`	`for i in 0 .. (g.len) {`
`90`	`90`	`if g[v][i] > 0 {`
`91`	`91`	`temp << i`
`@@ -147,7 +147,7 @@ fn dijkstra(g [][]int, s int) {`
`147`	`147`	`if dist[w] > new_dist {`
`148`	`148`	`dist[w] = new_dist`
`149`	`149`	`updating_priority(mut pq_queue, w, dist[w])`
`150`		`- path[w] = v //`
	`150`	`+ path[w] = v`
`151`	`151`	`}`
`152`	`152`	`}`
`153`	`153`	`}`