all: replace generic <> with [] - part 2 (#16536)

examples/graphs/bellman-ford.v

@@ -23,7 +23,7 @@ mut:
 
 // building a map of with all edges etc of a graph, represented from a matrix adjacency
 // Input: matrix adjacency --> Output: edges list of src, dest and weight
-fn build_map_edges_from_graph<T>(g [][]T) map[T]EDGE {
+fn build_map_edges_from_graph[T](g [][]T) map[T]EDGE {
 	n := g.len // TOTAL OF NODES for this graph -- its dimmension
 	mut edges_map := map[int]EDGE{} // a graph represented by map of edges
 
@@ -52,7 +52,7 @@ fn print_sol(dist []int) {
 // The main function that finds shortest distances from src
 // to all other vertices using Bellman-Ford algorithm.  The
 // function also detects negative weight cycle
-fn bellman_ford<T>(graph [][]T, src int) {
+fn bellman_ford[T](graph [][]T, src int) {
 	mut edges := build_map_edges_from_graph(graph)
 	// this function was done to adapt a graph representation
 	// by a adjacency matrix, to list of adjacency (using a MAP)

examples/graphs/dijkstra.v

@@ -36,7 +36,7 @@ mut:
 
 // Function to push according to priority ... the lower priority is goes ahead
 // The "push" always sorted in pq
-fn push_pq<T>(mut prior_queue []T, data int, priority int) {
+fn push_pq[T](mut prior_queue []T, data int, priority int) {
 	mut temp := []T{}
 	lenght_pq := prior_queue.len
 
@@ -57,7 +57,7 @@ fn push_pq<T>(mut prior_queue []T, data int, priority int) {
 }
 
 // Change the priority of a value/node ... exist a value, change its priority
-fn updating_priority<T>(mut prior_queue []T, search_data int, new_priority int) {
+fn updating_priority[T](mut prior_queue []T, search_data int, new_priority int) {
 	mut i := 0
 	mut lenght_pq := prior_queue.len
 
@@ -76,7 +76,7 @@ fn updating_priority<T>(mut prior_queue []T, search_data int, new_priority int)
 }
 
 // a single departure or remove from queue
-fn departure_priority<T>(mut prior_queue []T) int {
+fn departure_priority[T](mut prior_queue []T) int {
 	mut x := prior_queue[0].data
 	prior_queue.delete(0) // or .delete_many(0, 1 )
 	return x
@@ -84,7 +84,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 {
+fn all_adjacents[T](g [][]T, v int) []int {
 	mut temp := []int{}
 	for i in 0 .. (g.len) {
 		if g[v][i] > 0 {
@@ -95,7 +95,7 @@ fn all_adjacents<T>(g [][]T, v int) []int {
 }
 
 // print the costs from origin up to all nodes
-fn print_solution<T>(dist []T) {
+fn print_solution[T](dist []T) {
 	print('Vertex \tDistance from Source')
 	for node in 0 .. (dist.len) {
 		print('\n ${node} ==> \t ${dist[node]}')
@@ -103,7 +103,7 @@ fn print_solution<T>(dist []T) {
 }
 
 // print all  paths and their cost or weight
-fn print_paths_dist<T>(path []T, dist []T) {
+fn print_paths_dist[T](path []T, dist []T) {
 	print('\n Read the nodes from right to left (a path): \n')
 
 	for node in 1 .. (path.len) {

examples/graphs/minimal_spann_tree_prim.v

@@ -30,7 +30,7 @@ mut:
 
 // Function to push according to priority ... the lower priority is goes ahead
 // The "push" always sorted in pq
-fn push_pq<T>(mut prior_queue []T, data int, priority int) {
+fn push_pq[T](mut prior_queue []T, data int, priority int) {
 	mut temp := []T{}
 	lenght_pq := prior_queue.len
 
@@ -50,7 +50,7 @@ fn push_pq<T>(mut prior_queue []T, data int, priority int) {
 }
 
 // Change the priority of a value/node ... exist a value, change its priority
-fn updating_priority<T>(mut prior_queue []T, search_data int, new_priority int) {
+fn updating_priority[T](mut prior_queue []T, search_data int, new_priority int) {
 	mut i := 0
 	mut lenght_pq := prior_queue.len
 
@@ -72,7 +72,7 @@ fn updating_priority<T>(mut prior_queue []T, search_data int, new_priority int)
 }
 
 // a single departure or remove from queue
-fn departure_priority<T>(mut prior_queue []T) int {
+fn departure_priority[T](mut prior_queue []T) int {
 	mut x := prior_queue[0].data
 	prior_queue.delete(0) // or .delete_many(0, 1 )
 	return x
@@ -80,7 +80,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 {
+fn all_adjacents[T](g [][]T, v int) []int {
 	mut temp := []int{}
 	for i in 0 .. (g.len) {
 		if g[v][i] > 0 {