代码搜索结果

找到约 25,813 项符合 8 的代码

8.2.2利用子指针数组的普通树前根遍历算法.txt

STACK EQU 1FH BOTTOM EQU 00H TOP DATA 3EH TREE EQU 20H POINT1 EQU 21H POINT2 EQU 22H POINT3 EQU 23H OUT EQU 24H TST: MOV SP,#5FH MOV D

8.1.4后跟遍历.txt

STACK EQU 1FH BOTTOM EQU 00H TOP DATA 3EH TREE EQU 20H OUT EQU 21H TEST: MOV SP,#5FH MOV DPTR,#DATS MOV P2,#TREE MOV R0,#0 MOV R2,#32 COPY: CLR A

8.2.3利用子指针数组的普通树后根遍历算法.txt

STACK EQU 1FH BOTTOM EQU 00H TOP DATA 3EH TREE EQU 20H POINT1 EQU 21H POINT2 EQU 22H POINT3 EQU 23H OUT EQU 24H TST: MOV SP,#5FH MOV DPTR,

8.3.5利用邻接表图的深度优先生成树生成算法.txt

STACK EQU 1FH BOTTOM EQU 00H TOP DATA 3DH GRAPH EQU 20H TREE EQU 21H NODE EQU 30H FG EQU 40H D EQU 05H POINT EQU 80H N DATA 3EH K DATA

8.4.2利用邻接表的图最短路径算法.txt

GRAPH EQU 20H TREE EQU 21H QUEUE EQU 1FH NODE EQU 30H FG EQU 40H POINT EQU 80H LENGTH EQU 40H D EQU 05H F DATA 3CH R DATA 3DH N DATA 3E

8.1.1编号遍历.txt

TREE EQU 20H OUT EQU 21H TST: MOV DPTR,#DATS MOV P2,#TREE MOV R0,#0 MOV R2,#16 CPY: CLR A MOVC A,@A+DPTR MOVX @R0,A INC DPTR INC R0 DJNZ R2,CPY LCALL NOORDER ;遍历顺序为

8.3.2利用邻接表的图广度优先遍历算法.txt

GRAPH EQU 20H QUEUE EQU 1FH OUT EQU 21H NODE EQU 30H FG EQU 40H D EQU 05H F DATA 3CH R DATA 3DH N DATA 3EH K DATA 3FH TEST: MOV

8.1.2前根遍历.txt

STACK EQU 1FH BOTTOM EQU 00H TOP DATA 3EH TREE EQU 20H OUT EQU 21H TST: MOV SP,#5FH MOV DPTR,#DATS MOV P2,#TREE MOV R0,#0 MOV R2,#32 CPY: CLR A MOVC A,

8.4.1利用邻接矩阵的网络最小生成树算法.txt

NET EQU 20H LEN EQU 0E0H POINT EQU 0F0H N DATA 3EH K DATA 3FH TST: MOV SP,#5FH MOV DPTR,#NETDAT MOV P2,#NET MOV R0,#0 MOV R2,#80H CPY: CLR A MOVC

8.3.1利用邻接矩阵的图广度优先遍历算法.txt

GRAPH EQU 20H OUT EQU 21H QUEUE EQU 1FH F DATA 3CH R DATA 3DH N DATA 3EH K DATA 3FH TST: MOV SP,#5FH MOV DPTR,#GRA MOV P2,#GRAPH MOV R0,#