Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Marian POIROT
Our awesome project
Commits
412b2244
Commit
412b2244
authored
Jun 23, 2021
by
Valentin MEUNIER
Browse files
dijsktra.c
parent
bdf07e79
Changes
1
Hide whitespace changes
Inline
Side-by-side
laby/dijsktra.c
0 → 100644
View file @
412b2244
#include "dijsktra.h"
int
*
dijsktra
(
graph_t
*
graph
,
int
noeuds
,
int
nb_aretes
,
int
depart
)
{
int
*
parent
=
malloc
(
noeuds
*
sizeof
(
int
));
parent
[
depart
]
=
depart
;
poids_t
*
distance
=
malloc
(
noeuds
*
sizeof
(
poids_t
));
for
(
int
i
=
0
;
i
<
noeuds
;
i
++
)
{
distance
[
i
].
poids
=
noeuds
;
distance
[
i
].
val
=
i
;
}
distance
[
depart
].
poids
=
0
;
int
*
indice_valeur
=
malloc
(
noeuds
*
sizeof
(
int
));
for
(
int
i
=
0
;
i
<
noeuds
;
i
++
)
indice_valeur
[
i
]
=-
1
;
aretes_t
*
A
=
malloc
(
nb_aretes
*
sizeof
(
aretes_t
));
for
(
int
i
=
0
;
i
<
nb_aretes
;
i
++
)
A
[
i
]
=
graph
->
liste
[
i
];
tas_t
*
tas
=
init_tas
(
noeuds
+
1
);
for
(
int
i
=
0
;
i
<
noeuds
;
i
++
)
tas
->
tab
[
i
]
=
distance
[
i
];
tas
->
taille
=
noeuds
;
int
sommet
=
depart
;
int
i
=
0
;
int
oui
=
0
;
int
sauv
;
affiche_graph_couple
(
graph
,
noeuds
,
nb_aretes
);
while
(
nb_aretes
)
{
for
(
int
j
=
0
;
j
<
4
;
j
++
)
{
i
=
0
;
while
(
i
<
nb_aretes
&&
A
[
i
].
un
!=
sommet
&&
A
[
i
].
deux
!=
sommet
)
i
++
;
if
(
A
[
i
].
un
==
voisin
)
voisin
=
A
[
i
].
deux
;
else
if
(
A
[
i
].
deux
==
voisin
)
voisin
=
A
[
i
].
un
;
if
(
indice_valeur
[
voisin
]
!=-
2
)
{
if
(
indice_valeur
[
voisin
]
==-
1
)
{
distance
[
voisin
].
poids
=
1
+
distance
[
sommet
].
poids
;
ajouter_tas_min
(
tas
,
distance
[
voisin
],
indice_valeur
);
parent
[
A
[
i
].
deux
]
=
voisin
;
A
[
i
]
=
A
[
nb_aretes
-
1
];
nb_aretes
--
;
oui
=
1
;
}
// printf("poids :%d \n",tas->tab[indice_valeur[voisin]].poids);
else
if
(
distance
[
voisin
].
poids
>
1
+
distance
[
sommet
].
poids
);
{
distance
[
voisin
].
poids
=
1
+
distance
[
sommet
].
poids
;
percolation_bas_tas_min
(
tas
,
indice_valeur
[
voisin
],
indice_valeur
);
parent
[
A
[
i
].
deux
]
=
voisin
;
A
[
i
]
=
A
[
nb_aretes
-
1
];
nb_aretes
--
;
oui
=
1
;
}
}
}
if
(
oui
)
{
oui
=
0
;
indice_valeur
[
tas
->
tab
[
0
].
val
]
=
indice_valeur
[
tas
->
tab
[
tas
->
taille
-
1
].
val
];
indice_valeur
[
tas
->
tab
[
tas
->
taille
-
1
].
val
]
=-
2
;
typetas
aux
=
tas
->
tab
[
0
];
tas
->
tab
[
0
]
=
tas
->
tab
[
tas
->
taille
-
1
];
tas
->
tab
[
tas
->
taille
-
1
]
=
aux
;
tas
->
taille
+=-
1
;
percolation_bas_tas_min
(
tas
,
0
,
indice_valeur
);
sommet
=
tas
->
tab
[
0
].
val
;
}
}
// affichage(tas);
/*
for
(
int
i
=
0
;
i
<
tas
->
taille
;
i
++
)
printf
(
"%d "
,
tas
->
tab
[
i
].
poids
);
printf
(
"
\n
"
);
printf
(
"taille tas: %d
\n
"
,
tas
->
taille
);
printf
(
"nb_aretes: %d
\n
"
,
nb_aretes
);
}
// free(distance);
// free(A);
return
parent
;
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment