Introduction to Graph Theory - Part 3

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.

Added By:	Justin Bradley
Date Added:	24 Jul 2017 13:58
Name:
Tags:	Trees
Viewing permissions:	World
URL:	http://hub.edshare.ac.uk/id/eprint/4666
Downloads & Views

Actions (login required)

View Item