nihonium/mipt_clang
Archived
1
0
Fork 0
Code Releases Activity

dijkstra fix

Browse source
This commit is contained in:
nihonium 2022-05-13 10:16:44 +03:00
parent 16d8843135
commit 2b4d2ae03b
Signed by: nihonium
GPG key ID: 0924047F4136012C
1 changed files with 3 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
algo/first/dijkstra.c
View file

@ -10,9 +10,8 @@ typedef struct vertex_s {
int sel;
} vertex;
vertex *solve(unsigned int **adj, int n, int x); // 0 вершина(можно заменить в коде)
void route(int **adj, vertex *res, int n, int x);// для 0 вершины
vertex *solve(unsigned int **adj, int n, int x);
void route(unsigned int **adj, vertex *res, int n, int x);
int main() {
/* Количество вершин и номер нужной для отсчета вершины */
int n;
@ -117,7 +116,7 @@ vertex *solve(unsigned int **adj, int n, int x) {
return res;
}
void route(int **adj, vertex *res, int n, int x) {
void route(unsigned int **adj, vertex *res, int n, int x) {
for (int i = 0; i < n; i++) {
/* Игнорируем петли */
if (i == x) {