把一个迷宫用图的邻接表表示再通过图的遍历求最长路径c语言

把一个迷宫用图的邻接表表示。再来通过图的遍历求最长路径。c语言版#includeconsta[10][10]={{0,0,0,0,0,0,0,0,0,0},{0,0,1,1,0,0,0,0,1,0},{0,1,1,0,0,1,1,1,1,0},{0,0,1,0,1,1,0,1,1,0},{0,0,0,0,0,1,1,1,1,0},{0,0,1,0,0,0,0,0,1,0},{0,1,1,1,1,0,0,0,1,0},{0,1,1,1,1,0,0,0,1,0},{0,0,