graph-v2

graph-v2 copied to clipboard

Header `shortest_paths.hpp` adds dependency on `fmt/format.h`

3

This library should not depend on `fmt/format.h`, especially that on MSVC there is no reason to include it when we have ``.

akrzemi1

Missing `std::_Fake_copy_init` in MSVC build

5

I am using Microsoft Visual C++ 2022, version 17.3.4, both std C++20, and the experimental newest C++. The compilation of `std::graph::views::edges_breadth_first_search` fails with an error that `std::_Fake_copy_init` is not defined....

akrzemi1

Bug in DFS advance: premature unwinding element from DFS stack

4

First of all, I would like to thank you all for the great library, and attempt for making graph into standard library :clap:. Currently, I'm using this at work and...

TrungDinhT

Strongly Connected Components

3

neoblizz

At BFS and DFS base, the three_color vectors are not follow the passed Allocator type. https://github.com/stdgraph/graph-v2/blob/master/include/graph/views/breadth_first_search.hpp#L186 https://github.com/stdgraph/graph-v2/blob/master/include/graph/views/breadth_first_search.hpp#L72 So if I want to use my own allocator, like std::pmr::monotonic_buffer_resource, I got...

schaumb

Create mtx parser (from nwgraph)

1

neoblizz

Documentation for dynamic_graph and related classes for vertex and edge are weakly documented, and the documentation is referring to outdated implementations. This needs to be updated.

pratzl

Triangle Counting

10

neoblizz

Support for implicit graphs

2

Also a usecase for Dijkstra: https://github.com/milasudril/cheapest_route. In this case the graph is implicit. In particular, it will use 32 outgoing search directions. Also, it is not interesting to find the...

milasudril

## Simple Example ```cpp for (auto&& [uid, u] : views::vertexlist(g)) { auto deg = degree(g, u); } ``` or ```cpp for (auto&& u : vertices(g)) { auto deg = degree(g,...

neoblizz