CXXGraph Share on Table of Contents CXXGraph Table of Contents Introduction Algorithm Explanation Dijkstra Dial BFS DFS Cycle Detection Partition Algorithm Explanation Vertex-Cut Greedy Vertex-Cut Classes Explanation Requirements How to use Unit-Test Execution Google Test Installation How to Compile Test How to Run Test Benchmark Execution Google Benchmark Installation How to Compile Benchmark How to Run Benchmark Packaging Tarballs RPM DEB Install and Uninstall Install Linux Tarballs Install RPM Install DEB Install From Source Example How to contribute Site Contact Support References Credits We are Looking for... Introduction CXXGraph is a small library, header only, that manages the Graph and it's algorithms in C++. In other words a "Comprehensive C++ Graph Library". Algorithm Explanation Dijkstra Graph Dijkstras Shortest Path Algorithm(Dijkstra's Shortest Path) Dijkstra's Algorithm is used to find the shortest path from a source node to all other reachable nodes in the graph. The algorithm initially assumes all the…
Welcome to the DEV.to Community.
I'm Zig, and I'm a Open-Source Lover.
I'm Currently working on
Header-Only C++ Library for Graph Representation and Algorithms
CXXGraph
Share on
Table of Contents
Introduction
CXXGraph is a small library, header only, that manages the Graph and it's algorithms in C++. In other words a "Comprehensive C++ Graph Library".
Algorithm Explanation
Dijkstra
Graph Dijkstras Shortest Path Algorithm(Dijkstra's Shortest Path) Dijkstra's Algorithm is used to find the shortest path from a source node to all other reachable nodes in the graph. The algorithm initially assumes all the…
.
If someone interested in collaboration can write to me at zigrazor@gmail.com