Graph Theory.
path problem Given a weighted graph, find the shortest path of edges from node A to node B. Algorithms — BFS (unweighted graph), Dijkstra’s, Bellman-Ford, Floyd-Warshall, A*, etc. Source — https://youtu.be/87X57ldq1ok Connectivity — Does there exist a path between node A and node B? Algorithms —