Introduction to Graph Theory - Part 3

LoadingLoading previews...
Graph Theory Part 3
HTML Creative Commons: Attribution-Noncommercial-No Derivative Works 4.0 		View
    Graph Theory Part 3
    Graph Theory Part 3
    1 file in this resource
    Summary: 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:
    DR Mark Lynch
    Copyright holder: Copyright © Glasgow Caledonian University
    Tags: Trees
    Viewing permissions: World
    Depositing User:
    Mr Joseph Mills
    Date Deposited: 24 Jul 2017 13:58
    Last Modified: 20 Mar 2019 11:38
    URI: https://edshare.gcu.ac.uk/id/eprint/2764

    Actions (login required)

    View Item View Item

    Toolbox

    There are no actions available for this resource.