For this project, I worked on a team of three to create a graphical user interface that would find the shortest distance of connections between a LinkedIn user to an employee at the desired company. We used C++, SFML, and custom-made sprites to create the GUI. We used object-oriented programing and designed a graph/hash map data structure to store all the data points of connections across three main users (the members of the team). These data connections were sourced from multiple LinkedIn accounts and read into the program using iostream with csv files. We also implemented depth first search and breadth first search algorithms to find the shortest distance between two LinkedIn users. From the GUI, the user can decide to load someone’s entire list, insert a connection, and find the shortest distance to a company in a network using either breadth first search and depht first search.
In this demo, the user has decided to to search Nathalie’s network for someone that works at Apple and the program displays the path of connections.