Greg Osuri gosuri
gosuri
/ dfs.asm
Last active
September 21, 2016 22:27
Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking. A graph can be represented by its adjacency matrix G, where G[i][j] == 1 if there is an edge betwe…
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| .data | |
| Graph: .word 0,1,1,0,0,1,1,0,0 | |
| .word 1,0,0,0,0,0,0,0,0 | |
| .word 1,0,0,0,0,0,0,0,0 | |
| .word 0,0,0,0,1,1,0,0,0 | |
| .word 0,0,0,1,0,1,1,0,0 | |
| .word 1,0,0,1,1,0,0,0,0 | |
| .word 1,0,0,0,1,0,0,0,0 | |
| .word 0,0,0,0,0,0,0,0,0 | |
| .word 0,0,0,0,0,0,0,0,0 |