Hello there to one and all reading this . I am high school student who is into computer science from India . I am a beginner in the field of computer science but with time passing by , with the help of people I might meet here I shall consider myself lucky to gather more knowledge .
French web developer mainly but touches everything. Volunteer mod here at DEV. I learn Nuxt at this moment and databases. — Addict to Cappuccino and Music
And this is my actual main is an header-only C++ library for Graph representation, manipulation, partitioning and algorithms called CXXGraph. All contributions are welcome ( also a simple star if you like it ).
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 nodes are unreachable from the given source node so we mark the distances of all nodes as infinity
(infinity) from source node (INF / infinity denotes unable to reach).
Hello there to one and all reading this . I am high school student who is into computer science from India . I am a beginner in the field of computer science but with time passing by , with the help of people I might meet here I shall consider myself lucky to gather more knowledge .
Hello and welcome to Dev.to Community ! 👋🏼😎
Hi, I'm ZigRazor. I'm a software developer specialized in C++ and Python Application.
I hope to find community support for my open source work.
This is my GitHub Profile
My Profile Readme
Hi👋 , I'm Zig Razor
I'm a Software Engineer. I love programming, and low level problems. I'm interested in CyberSecurity, Machine Learning, Advanced Algorithms.
Connect with me:
Languages and Tools:
And this is my actual main is an header-only C++ library for Graph representation, manipulation, partitioning and algorithms called CXXGraph. All contributions are welcome ( also a simple star if you like it ).
Header-Only C++ Library for Graph Representation and Algorithms
CXXGraph
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 nodes are unreachable from the given source node so we mark the distances of all nodes as infinity (infinity) from source node (INF / infinity denotes unable to reach).
Dial
Dial specialization of dijkstra’s algorithm.
When edge…
Thank you so much.
Best Regards.