Find
Search for over 200,000 study notes and past assignments!
Swap
Download study resources by swapping your own or buying Exchange Credits.
Study
Study from your library anywhere, anytime.
CS2040 Group Project: Breadth-first Search for Flight Scheduling Code Implementation Report
CS2040 - Data Structures and Algorithms
6 Pages • Essays / Projects • Year Uploaded: 2022
This report seeks to discuss about Breadth-first search (BFS) for flight scheduling. BFS starts at the first node of a graph, and explores the neighbouring nodes before moving on to the next level of neighbours, finding every other neighbour that is at the distance k before exploring any vertices that are distance k+1. There is no order involved when we explore the neighbouring nodes. Each node can only be visited EXACTLY once, and every edge, twice, in a forward direction as it is visiting neighbouring nodes, and once backwards, when it is backtracking after it’s done searching through all the neighbouring nodes. A queue system, which utilises the First-Come First-Serve implementation, is used to store the neighbouring vertices which will be visited after the current vertex. Every instance of visiting a vertex, it will be marked as “visited”, such that it will not be put in the queue and be visited again. BFS will be done till all vertices in the graph has been visited, that is, when the queue becomes empty.
This document is 20 Exchange Credits
More about this document:
|
|
This document has been hand checkedEvery document on Thinkswap has been carefully hand checked to make sure it's correctly described and categorised. No more browsing through piles of irrelevant study resources. |
|
|
This is an Essay / ProjectEssays / Projects are typically greater than 5 pages in length and are assessments that have been previously submitted by a student for academic grading. |
|
|
What are Exchange Credits?Exchange Credits represent the worth of each document on Thinkswap. In exchange for uploading documents you will receive Exchange Credits. These credits can then be used to download other documents for free. |
|
|
Satisfaction GuaranteeWe want you to be satisfied with your learning, that’s why all documents on Thinkswap are covered by our Satisfaction Guarantee. If a document is not of an acceptable quality or the document was incorrectly described or categorised, we will provide a full refund of Exchange Credits so that you can get another document. For more information please read Thinkswap's Satisfaction Guarantee. |
Studying with Academic Integrity
Studying from past student work is an amazing way to learn and research, however you must always act with academic integrity.
This document is the prior work of another student. Thinkswap has partnered with Turnitin to ensure students cannot copy directly from our resources. Understand how to responsibly use this work by visiting ‘Using Thinkswap resources correctly’.
Browse NUS Subjects
