//////////////////////////////////////////////////////////////////////////////////////// --------- Strongly Connected Sub-Graph Finder ----------- \\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ Hi, this project finds and renders connected sub-graphs of a given oriented graph, to use your own graph you just need to press space then enter the edges of your graph with: [original node]-[end node] (for exemple: 1-2 3-1 create a graph with 3 nodes and 2 edges: one going from 1 to 2 and one going from 3 to 1) You can turn on/off the simulation of the graph using 'x' and you can turn on/off the automatic camera movement with 'c'... if the color don't feat you can press 'r' to try some other, also, if you want to turn on/off the render of the nodes and edges press 's' and 'h' to hide/show which node you are hovering... This project uses the Kosaraju's algorithm to find the sub-graphs (the proof of the algorithm is, I think, quite interesting: https://sharmaeklavya2.github.io/theoremdep/nodes/graph-theory/kosaraju-algo.html) It also uses Graham's scan from one of my previous project and finaly a little physics simulation (mainly springs and 'social distance'), funny enough, it acts like jelly when moved around lol) Thanks to the creator of those algorithms... everything else by me... [well... don't mind this] #math #graph #physic #spring #convexe #connected #computer
