# S12 Graphes (3) Parcours en profondeur

import queue as q

g1_NO_d = {0:[2], 1:[2], 2:[0, 1, 3, 4], 3:[2, 4], 4:[2, 3]}
g1_NO_m = [[0,0,1,0,0], [0,0,1,0,0],[1,1,0,1,1],[0,0,1,0,1],[0,0,1,1,0]]

g2_O_d = {0:[2], 1:[0,3], 2:[3], 3:[2, 4], 4:[0]}
g2_NO_d = {0:[1, 2, 4], 1:[0, 3], 2:[0, 3], 3:[1, 2, 4], 4:[0, 3]}
g2_O_m = [[0,0,1,0,0], [1,0,0,1,1],[0,0,0,1,0],[0,0,1,0,1],[1,0,0,0,0]]

g3_NOtest_d = {0:[1,4,5],1:[0,2], 2:[1,3],3:[2,4],4:[0,3,5,6],5:[0,4],6:[4], 7:[]}

g4_NOtest_d = {0:[1,4,5],1:[0,2], 2:[1,3],3:[2,4],4:[0,3,5,6],5:[0,4],6:[4], 7:[]}