I am new to this channel, but I was surprised to learn that the name for Java was almost Oak. If you don't mind, I have a question on your CO658 W9 C++ Graphs video. When you talk about searching by breadth and depth, are these graphs the building blocks for finding things on online maps?
Hi! Thanks so much for checking out these videos. Regarding online maps, yes, in my experience a graph is a good way to represent the distances between nodes or locations on a map. Locations on a map could be represented using nodes, stored in a data structure, and the distances between nodes stored in an adjacency matrix (which also then dictates the routes between locations on the map). But in order to navigate the map (as the app can only look at the next node from the current node - it can't see the entire map like we can!), adhering to the routes specified, there are two approaches: breadth and depth... So the graph represents the distances between the locations, and BFS and DFS are algorithms to navigate the map. I hope that helps provide a little more context?
@@NicholasDayPhD Thank you for your reply! Yes, this explanation is helpful. I'm trying to learn more about basic programming and how things work around a computer. I was put in charge of a SharePoint page that works like a website at work, so to say I'm a bit lost right now is not an understatement lol. Thank you, again! Your videos are very valuable.
Very insightful Nick, great content, hopefully catch up soon
Thank you so much, Robert! Yes, must catch up soon.
I am new to this channel, but I was surprised to learn that the name for Java was almost Oak. If you don't mind, I have a question on your CO658 W9 C++ Graphs video. When you talk about searching by breadth and depth, are these graphs the building blocks for finding things on online maps?
Hi! Thanks so much for checking out these videos. Regarding online maps, yes, in my experience a graph is a good way to represent the distances between nodes or locations on a map. Locations on a map could be represented using nodes, stored in a data structure, and the distances between nodes stored in an adjacency matrix (which also then dictates the routes between locations on the map). But in order to navigate the map (as the app can only look at the next node from the current node - it can't see the entire map like we can!), adhering to the routes specified, there are two approaches: breadth and depth... So the graph represents the distances between the locations, and BFS and DFS are algorithms to navigate the map. I hope that helps provide a little more context?
@@NicholasDayPhD Thank you for your reply! Yes, this explanation is helpful. I'm trying to learn more about basic programming and how things work around a computer. I was put in charge of a SharePoint page that works like a website at work, so to say I'm a bit lost right now is not an understatement lol. Thank you, again! Your videos are very valuable.