mirror/v
1
0
Fork 0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
Code Issues Projects Releases Wiki Activity

examples: remove empty comments (#14986)

Browse Source
This commit is contained in:
Emirhan Yener 2022-07-08 15:35:45 +03:00 committed by GitHub
parent 02d675ab67
commit 1a49db4ea1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
examples/graphs/dijkstra.v
View File

@ -85,7 +85,7 @@ fn departure_priority<T>(mut prior_queue []T) int {
// give a NODE v, return a list with all adjacents // give a NODE v, return a list with all adjacents
// Take care, only positive EDGES // Take care, only positive EDGES
fn all_adjacents<T>(g [][]T, v int) []int { fn all_adjacents<T>(g [][]T, v int) []int {
mut temp := []int{} // mut temp := []int{}
for i in 0 .. (g.len) { for i in 0 .. (g.len) {
if g[v][i] > 0 { if g[v][i] > 0 {
temp << i temp << i
@ -147,7 +147,7 @@ fn dijkstra(g [][]int, s int) {
if dist[w] > new_dist { if dist[w] > new_dist {
dist[w] = new_dist dist[w] = new_dist
updating_priority(mut pq_queue, w, dist[w]) updating_priority(mut pq_queue, w, dist[w])
path[w] = v // path[w] = v
} }
} }
} }

2
examples/graphs/minimal_spann_tree_prim.v
View File

@ -81,7 +81,7 @@ fn departure_priority<T>(mut prior_queue []T) int {
// give a NODE v, return a list with all adjacents // give a NODE v, return a list with all adjacents
// Take care, only positive EDGES // Take care, only positive EDGES
fn all_adjacents<T>(g [][]T, v int) []int { fn all_adjacents<T>(g [][]T, v int) []int {
mut temp := []int{} // mut temp := []int{}
for i in 0 .. (g.len) { for i in 0 .. (g.len) {
if g[v][i] > 0 { if g[v][i] > 0 {
temp << i temp << i