Skip to content

Commit 2a9a66a

Browse files
fix indentation
1 parent ac0c52e commit 2a9a66a

File tree

1 file changed

+17
-17
lines changed

1 file changed

+17
-17
lines changed

0x07-c_pathfinding/3-a_star_graph.c

+17-17
Original file line numberDiff line numberDiff line change
@@ -42,24 +42,24 @@ vertex_t *get_vertex_index(const graph_t *graph, size_t index)
4242
*
4343
* Return: minimum tentative gScoreance among the nodes in the unvisited
4444
*/
45-
size_t get_smallest(graph_t *graph, size_t *fScore, size_t *v, size_t *index)
46-
{
47-
size_t min = INF;
48-
size_t *a = fScore;
49-
size_t i = 0;
45+
size_t get_smallest(graph_t *graph, size_t *fScore, size_t *v, size_t *index)
46+
{
47+
size_t min = INF;
48+
size_t *a = fScore;
49+
size_t i = 0;
5050

51-
while (i < V)
52-
{
53-
if (*a < min && v[i] == UNEXPLORED)
54-
{
55-
min = *a;
56-
*index = i;
57-
}
58-
a++;
59-
i++;
60-
}
61-
return (min);
62-
}
51+
while (i < V)
52+
{
53+
if (*a < min && v[i] == UNEXPLORED)
54+
{
55+
min = *a;
56+
*index = i;
57+
}
58+
a++;
59+
i++;
60+
}
61+
return (min);
62+
}
6363

6464
/**
6565
* loadQueue - A function that loads the queue with vertices of shortest path

0 commit comments

Comments
 (0)