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
2d5eaef7
Commit
2d5eaef7
authored
Jun 24, 2021
by
Valentin MEUNIER
Browse files
dfs
parent
8bd72610
Changes
3
Hide whitespace changes
Inline
Side-by-side
laby/DFS.c
0 → 100644
View file @
2d5eaef7
#include "DFS.h"
void
explorer
(
int
**
laby
,
int
sommet
,
int
*
som
,
int
*
explo
)
{
som
[
sommet
]
=-
1
;
explo
[
explo
[
0
]]
=
sommet
;
explo
[
0
]
+=
1
;
if
(
laby
[
sommet
%
P
][
sommet
/
P
]
&
FLAG_N
)
if
(
som
[
laby
[
sommet
%
P
][
sommet
/
P
]]
!=-
1
)
explorer
(
laby
,
laby
[
sommet
%
P
][
sommet
/
P
],
som
,
explo
);
if
(
laby
[
sommet
%
P
][
sommet
/
P
]
&
FLAG_S
)
if
(
som
[
laby
[
sommet
%
P
][
sommet
/
P
]]
!=-
1
)
explorer
(
laby
,
laby
[
sommet
%
P
][
sommet
/
P
],
som
,
explo
);
if
(
laby
[
sommet
%
P
][
sommet
/
P
]
&
FLAG_O
)
if
(
som
[
laby
[
sommet
%
P
][
sommet
/
P
]]
!=-
1
)
explorer
(
laby
,
laby
[
sommet
%
P
][
sommet
/
P
],
som
,
explo
);
if
(
laby
[
sommet
%
P
][
sommet
/
P
]
&
FLAG_E
)
if
(
som
[
laby
[
sommet
%
P
][
sommet
/
P
]]
!=-
1
)
explorer
(
laby
,
laby
[
sommet
%
P
][
sommet
/
P
],
som
,
explo
);
}
int
*
DFS
(
int
**
laby
,
int
noeuds
)
{
int
*
explo
=
malloc
((
noeuds
+
1
)
*
sizeof
(
int
));
explo
[
0
]
=
1
;
int
*
som
=
malloc
(
noeuds
*
sizeof
(
int
));
for
(
int
i
=
0
;
i
<
noeuds
;
i
++
)
som
[
i
]
=
0
;
for
(
int
i
=
0
;
i
<
noeuds
;
i
++
)
explorer
(
laby
,
laby
[
0
][
0
],
som
,
explo
);
return
explo
;
}
laby/DFS.h
0 → 100644
View file @
2d5eaef7
#ifndef _gard__
#define _gard_dijsktra_
#include "main.h"
void
explorer
(
int
**
laby
,
int
sommet
,
int
*
som
,
int
*
explo
);
int
*
DFS
(
int
**
laby
,
int
noeuds
);
#endif
laby/DFS.o
0 → 100644
View file @
2d5eaef7
File added
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