The Stockbroker Grapevine problem involves finding the shortest amount of time to spread rumours to all stockbrokers in a given set of networks. If there exists a stockbroker who cannot be reached in a particular network, the program should warn the user of a disjoint network.
This little exercise requires the use of Dijkstra’s infamous shortest path algorithm. My solution is inspired by that of my university tutor (Enoch Lau) and was coded as a tutorial exercise for the INFO3220 Object Oriented Design in C++.
Source code is available on GitHub.
