36. AQA A Level (7517) SLR5 - 4.3.1 Graph traversal algorithms скачать в хорошем качестве

36. AQA A Level (7517) SLR5 - 4.3.1 Graph traversal algorithms

AQA Specification Reference A Level 4.3.1.1 In this video we overview algorithms which can be used to traverse a graph data structure. We cover both breadth-first and depth-first methods. Key questions: How do graphs work? How do you create a graph? How do you add a data item to a graph? How do you remove a data item from a graph? How do you traverse a graph? 00:00 Graph traversal algorithms 00:10 Intro 00:14 Traversing, adding to and removing from a graph 00:46 Adding an item to a graph 01:58 Removing an item from a graph 02:36 Traversing a graph 02:54 Traversing a graph using a breadth-first search 08:56 Traversing a graph with a depth-first search 15:52 Comparing breadth-first and depth-first traversal algorithms 16:48 Key questions 17:05 Outro Why do we disable comments? We want to ensure these videos are always appropriate to use in the classroom. However, we value your feedback, and are happy to consider amendments due to inaccuracies. Please get in touch with us directly at: admin@craigndave.co.uk For all our support resources please visit: http://craigndave.org/ http://student.craigndave.org/