graph

graph copied to clipboard

Dijkstra's shortest paths ignores color_map named parameter

1

Dijsktra's shortest paths takes as parameter UTIL/OUT a color_map. Which should be passed to and used by breadth first search. However, the current implementation ignores the color_map, if provided, and...

SamueleDecarli

GCC suggest-override warnings

2

Complete list of warnings when Boost 1.72 is built with GCC 7.5 with `-Wsuggest-override` added to `cxxflags`: ./boost/graph/graphml.hpp:41:25: warning: ‘virtual const char* boost::parse_error::what() const’ can be marked override [-Wsuggest-override] ./boost/graph/graphviz.hpp:622:23:...

EugeneZelenko

bucket_sorter.cpp does not compile

6

``` 1>bucket_sorter.cpp 1>d:\data\boost\boost\libs\graph\example\bucket_sorter.cpp(46): warning C4267: 'argument': conversion from 'size_t' to 'const int', possible loss of data 1>d:\data\boost\boost\libs\graph\example\bucket_sorter.cpp(65): warning C4267: 'argument': conversion from 'size_t' to 'const int', possible loss of data...

jzmaddock

csr-example.cpp does not compile

2

I see: ``` 1>csr-example.cpp 1>d:\data\boost\boost\boost\graph\graphviz.hpp(265): error C2064: term does not evaluate to a function taking 1 arguments 1>d:\data\boost\boost\boost\graph\graphviz.hpp(291): note: see reference to function template instantiation 'void boost::write_graphviz(std::ostream &,const Graph &,VertexPropertiesWriter,EdgePropertiesWriter,GraphPropertiesWriter,VertexID,boost::graph::detail::no_parameter)'...

jzmaddock

providing an initial mapping to mcgregor_common_subgraph?

1

Would it be reasonable to extend functionality so that the user can provide a pre-specified mapping (often determined by some heuristic) as a seed? I noticed that the internals initialize...

proteneer

I'm trying to construct a graph with its copy constructor. It runs successfully. I could access its property with the descriptors of previous graph. So I'm think the descriptors in...

TheStoryOfUnlimitedDreams

Confusing function signature of dfs, bfs searches

1

In the [documentation](https://www.boost.org/doc/libs/1_75_0/libs/graph/doc/depth_first_search.html) of (for example) depth first search. The signature of the named parameter version requires a lvalue mutable reference graph. ```c++ // named parameter version template void depth_first_search(Graph&...

TonyXiang8787

Store properties without indirection

1

`stored_edge_property` contains a `std::unique_ptr` instead of the raw `Property`. In my application, this doubles the memory use of the graph and more than doubles the running time. It comes with...

mglisse

Add user callback to `vf2_subgraph_mono` to potentially stop search before each check.

6

Also update documentation and add tests. See the discussion on #271 . Remarks: * I used a simple function pointer for the type rather than a templated "callable" so as...

cqc-alec

Added Karps Minimum Cycle Algorithm

7

Based on issue #272. Implemented [Karps Minimum Cycle Algorithm](https://www.sciencedirect.com/science/article/pii/0012365X78900110).

GYuvanShankar