I just gave the final talk of my interdisciplinary research project (IDP) about the visualisation of advanced graph algorithms. You can read the talk’s abstract
and browse through the talk’s slides right in your browser, since I used reveal.js to make them.

The interactive visualizations of the two graph algorithms I choose are still work in progress and require some furbishing and bugfixing, but you can test them out already: Push-relabel algorithm for the max flow problem
Label Setting algorithm for the SPPRC problem

I welcome any feedback!

All the code developed is open sourced in the github repository idp-graph-algorithms

The final documentation is still work in progress, but I will upload it here once finished.