Graphlib 3.1 – the C++ 23, header only solution to directional graphs
Graphlib 3.1 – the C++ 23, header only solution to directional graphs
Graphlib 3.1, the newest version of Graphlib has added a bunch of new features and algorithms we are excited to show. BFS: The BFS algorithm is finally done and implemented DFS: The DFS algorithm is also finished Dijkstra's algorithm is 90% finished! It will be released on version 3.2 NEW ADDITIONS: Reshaped README.md Added more functions BFS was added DFS was added graphlib:: namespace was added You are now able to do more than just integers for node names (check README) weights can now be integers or floats! Heavy performance improvements! If you want, come check out Graphlib!
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Incorrect prediction on native model
Similar products
Lorentz Embeddings of Graphs in 2-5 Dimensions
Lazily-evaluated graphs from sympy expressions
Sierpiński and Other Kronecker Graphs with the GraphBLAS
Semi-Supervised-Segmentation-on-Graphs
E-graphs and equality saturation in Haskell
Flame graphs for Ruby on Rails using MiniProfiler
CinemaBuff - Actor graphs using IMDB ratings
We're building graphs of Hurricane Sandy with pressureNET
Metis - A Divine Solution for Unix Aliases
My solution to scaling P2Pool