aizen93 / large-interaction-networks Goto Github PK

Is your feature request related to a problem? No.
new feature, calculating shortest path between a source node and destination node using BFS algorithm

Describe the solution you'd like
Once the path is calculated, we draw it on the 2D scene and animate the edges so we can see the path clearly.

Describe alternatives you've considered
Using BFS algorithm or any other shortest path algorithm. Must be optimised tho, because some graphs are very big.

Additional context
Calculating shortest path between A and B is nice but what if we want to stop by a node before going to B? So as extra, Add the option of a stop node. For example we want to calculate shortest path between A and B but we must go through C.

TP4 Louvain's Algorithm Heapspace exception can be catched. This occurs when we handle graphs with more than 1 Millions nodes du to initialisation of the adjencency matrix, too much zeros that we can ignore by transforming the matrix double[][] into a Hashmap of Sets.

Rendering the graph in a 2D visual using the dark blue buttons (add a new one) using the force directed drawing method for better visual clarity

here is a wikipedia page for more details: Force-directed graph drawing wikipedia

Calculate the shortest path between two nodes or between two nodes through a third node and show the result in the 3D world in real time.