Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2012:journals:jeanpaul:chapterthreesectionii [2012/01/31 01:35] – mugabej | courses:cs211:winter2012:journals:jeanpaul:chapterthreesectionii [2012/01/31 01:40] (current) – mugabej | ||
|---|---|---|---|
| Line 38: | Line 38: | ||
| ==Algorithm== | ==Algorithm== | ||
| - | DFS(u): | + | DFS(u): |
| - | Mark u as " | + | Mark u as " |
| For each edge (u,v) incident to u: | For each edge (u,v) incident to u: | ||
| >>>>> | >>>>> | ||
| Line 46: | Line 46: | ||
| Endfor | Endfor | ||
| + | In brief, when trying to efficiently solve problems that involve graph traversal, BFS and DFS are the best options available to the algorithm designer. Both BFS and DFS allows easy and efficient traversals of a graph, which in turn helps solve some problems that involve huge graphs.\\ | ||
| + | This section was also interesting and easy to read,so why not give it a 9/10?Yeah, I give it a 9/10. | ||
