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 generated to get the slope of the nodes and then traverse accordingly.
Here are the snapshots of the project !!
It was an awesome experience to get such a project completed in our 6th semester (3rd year).
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 generated to get the slope of the nodes and then traverse accordingly.
Here are the snapshots of the project !!
It was an awesome experience to get such a project completed in our 6th semester (3rd year).
Hi sir, i tried executing the program but it shows this "Run-Time Check Failure #3 - The variable 'sign' is being used without being initialized."
ReplyDeleteAny solutions? Please help
@amplify which machine are you using? I have update the README to showcase how to run in ubuntu. Similarly it should be available for other destro.
DeleteHey buddy, how can it be implemented for n nodes ??
ReplyDeletePlss render me a code or an idea... .
Hi, for n nodes, you have to generate the nodes with matrices randomly. Right now the code is for fixed positions, imagine to update the code to render wherever the points are provided.
DeleteThis comment has been removed by the author.
ReplyDeleteIt is very useful information about React js. This is the place for learner and glad to be here in this blog Thank you
ReplyDeleteReact js Training in Hyderabad
Enroll
Excellent blog,Thanks for sharing the such a nice information with us. I am a regular reader of your blog. Web Development Company in Bangalore | Web Design Company in Bangalore | Website Design Companies in Bangalore | Website Designing Company in Bangalore | Web Designing Company in Bangalore
ReplyDeleteSir can you please provide me the opengl source code of bellman Ford algorithm without an error.
ReplyDeleteSorry, i had developed this a long time ago. So won't be in a position to introduce anything new.
DeleteBy any chance do you still have the project report, It would be very helpful.
ReplyDeletei would like to see the report to go through its workings and such
ReplyDelete