GraphStream is a dynamic graph library written in Java that provides Java developers a way to easily represent dynamic graphs in memory, on screen or in files. Video demo.
GraphStream provides a framework to handle the evolution of graphs, that is the changes on values stored on edges and nodes of a graph during time, but also the "topology" changes of the graph, that is the addition, removal and modification of nodes and edges during time.
Is there an equivalent of GraphStream in HTML5 (element canvas with JavaScript) with this kind of algoritmes :
- Welsh-Powell
- Betweenness Centrality
- Random walks on graphs
- Several often used algorithms on graphs
- Base for spanning-tree algorithm
- BellmanFord
- Kruskal, spanning-tree algorithm
- Prim, spanning-tree algorithm
- Centroid
- Eccentricity
- All Pair Shortest Path
- Dijkstra
- Connected Components
- etc.