| Summary: |
In Section 3.5 we introduced a specialised graph called a tree. A tree is a connected graph with no cycles and occurs commonly as a data structure in computer science, playing a significant role in computer networks.
An important application when working with trees is the ability to search them for data they may hold. In this section we describe two algorithms for searching trees: depth first search (DFS) and breadth first search (BFS). These two algorithms have simple variations for searching digraphs and graphs but these are not followed up here. |
| Creators: |
|
| Divisions: |
Academic > School of Computing, Engineering and Built Environment > Department of Computing |
| Copyright holder: |
Copyright © Glasgow Caledonian University |
| Viewing permissions: |
World |
| Depositing User: |
|
| Date Deposited: |
20 Mar 2019 11:51 |
| Last Modified: |
15 Jan 2020 07:54 |
| URI: |
https://edshare.gcu.ac.uk/id/eprint/4728 |
Loading previews...
