diff --git a/examples/graphs/dijkstra.v b/examples/graphs/dijkstra.v
index 147b022e30..72fa066996 100644
--- 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
index 51809e1683..60c0c47b5b 100644
--- 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