CXXGraph

CXXGraph copied to clipboard

There is the necessity to write more test on Dial Algorithm. Specialy on limit case. Any contribution is appreciated.

ZigRazor

Add Test on Cycle Check Algorithm

4

There is the necessity to write more test on Cycle Check Algorithm. Specialy on limit case. Any contribution is appreciated.

ZigRazor

There is the necessity to write more test on DFS Algorithm. Specialy on limit case. Any contribution is appreciated.

ZigRazor

How to best improve results of an algorithm (get nodes and order in path)

4

Dear developers, First; thank you for this library. Much leaner than boost :) I use the Bellman Ford algorithm with negative edges to find the longest path in a directed...

luminize

add Karger's Algorithm for partitioning a graph.

5

Please add An implementation of Karger's Algorithm for partitioning a graph.

ZigRazor

Add Travelling Salesman Problem implementation

10

Add [Travelling Salesman Problem](https://en.wikipedia.org/wiki/Travelling_salesman_problem) implementation.

ZigRazor

Build a Docusaurus Documentation

5

Please add Documentation Site built with Docusaurus. This issue can be releated to #213 .

ZigRazor

Use Adjacency Matrix to populate the nodeSet.

7

At present, the getNodeSet() method iterates over all the edges to populate the nodeSet. A better solution can be to use the adjacency matrix of the graph to populate the...

guru2396

Algorithm to find Articulations points

13

Please add an algorithm to find articulation points of a graph

ZigRazor

Inclusion of "sink nodes" in adjacency map

1

This issue is related to the discussion in issue #367. When we build the adjacency matrix for a directed graph we only add an element for the source node. ```...

sbaldu