Dijkstra's algorithm in OpenGL - Network simulation
I and my friend late Mr. Padmaprasad Kusagundi (will always miss him), had created an OpenGL project for the syllabus in our college, G.I.T, college, Belgaum, Karnataka, India. We had worked day and night over this. The github repo is here: https://github.com/tan31989/Dijkstra-opengl-network-simulation This project has used basic programming elements of OpenGL. Here we used Dijkstra's algorithm and modified it to any source to any destination (as opposed to single source and all the destination). The nodes of which looks like a box in here are hard coded as, we never had a chance to take it to the next level. (PS: hoping to increase its vicinity). The distance matrix, also was fixed in the code, to make it dynamic was just another step, but again, we kept it low :). When the program is run, it asks to select the source and a destination and later step to find the shortest path between the given source and the destination. The packets that are designed here are so generat