鏁版嵁緇撴瀯絎竷绔犲～絀洪[7]_璺ㄨ€冪綉

1錛庝笅闈㈢殑綆楁硶瀹屾垚鍥劇殑娣卞害浼樺厛閬嶅巻錛岃濉┖銆?/span>

銆€銆€PROGRAM graph_traver;

銆€銆€CONST nl=max_node_number;

銆€銆€TYPE vtxptr=1..nl; vtxptr0=0..nl;

銆€銆€arcptr=^arcnode;

銆€銆€arcnode=RECORD vexi ,vexj: vtxptr; nexti, nextj: arcptr; END;;

銆€銆€vexnode=RECORD vexdata: char; firstin錛?/span>firstout: arcptr; END;

銆€銆€graph=ARRAY[vtxptr0] OF vexnode ;

銆€銆€VAR ga:graph; n: integer;

銆€銆€visited: ARRAY[vtxptr0] OF boolean ;

銆€銆€FUNC order (g: graph; v: char): vtxptr;

銆€銆€(1)_______; i:=n;

銆€銆€WHILE g[i].vexdata<>v DO i:=i-1;

銆€銆€order:=i;

銆€銆€ENDF錛?/span>

銆€銆€PROC creat(var g: graph);

銆€銆€readln(n,e);

銆€銆€FOR i:= 1 TO n DO {readln(g[i].vexdata); g[i].firstin :=NIL ; g[i].firstout:=NIL;}

銆€銆€FOR k:= 1 TO e DO {readln (vt,vh);

銆€銆€i:=order (g,vt); j:=order (g,vh); new (p); p^.vexi:=i ; p^.vexj:=j

銆€銆€p^.nextj:= ____(2)____; ___(3)____ :=p;

銆€銆€p^.nexti:=: ____(4)____; ___(5)____ :=p;}

銆€銆€ENDP;

銆€銆€FUNC firstadj(g:graph; v:char): vtxptr0;

銆€銆€i:=order(g,v); p:=g[i].firstout;

銆€銆€IF p<>NIL THEN firstadj:=(6)_______ELSE firstadj:=0;

銆€銆€ENDF;

銆€銆€FUNC nextadj(g:graph; v:char; w:char): vtxptr0;

銆€銆€i:=order(g,v); j:=order(g,w); p:=(7)_______;

銆€銆€WHILE(p<>NIL ) AND (p^.vexj<>j) DO(8)______;

銆€銆€IF (9)______AND(10)______THEN nextadj:=p^.nexti^.vexj ELSE nextadj:=0;

銆€銆€ENDF;

銆€銆€PROC dfs(g:graph; v0:char);

銆€銆€write(v0:2); visited[order(g,v0)]:=true; w:=(11)_______;

銆€銆€WHILE w<>0 DO

銆€銆€{IF (12)______ THEN dfs(g,g[w].vexdata);

銆€銆€w:=(13)_______;}

銆€銆€ENDP;

銆€銆€PROC traver(g:graph);

銆€銆€FOR i:=1 TO n DO visited[i]:=false;

銆€銆€FOR i:=1 TO n DO IF NOT visited[i] THEN dfs(g,g[i].vexdata);

銆€銆€ENDP;

銆€銆€BEGIN

銆€銆€creat(ga); traver(ga);

銆€銆€END. 銆愬寳鏂逛氦閫氬ぇ瀛?/span> 1999 涓夛紙20鍒嗭級銆?/span>