graph

graph copied to clipboard

Sample output of filtered_graph_edge_range.cpp is wrong

2

The sample output provided for the code in filtered_graph_edge_range.cpp is wrong.

sreejithsankar55

Dijkstra SPP can take multiple start vertices.

13

Instead of a single start vertex a range of start vertices can be handed in. The range is modeled by two iterators s_begin and s_end. The reason to use iterators...

mfuchs

Expected outputs of graph/example/subgraph.expected and graph/example/subgraph.cpp is incorrect.

sreejithsankar55

THX to Ireneusz Szcześniak for finding this bug

wygos

dijkstra_shortest_paths_no_init supports pruning on distances

8

``` When the distance map is given and the newly discovered distance is worse than the distance stored in the distance map, the vertex is not even added to the...

wygos

No add_edge in labeled_graph

2

while trying to build the example labeled_graph.cpp I see: ``` 1>d:\data\boost\boost\libs\graph\example\labeled_graph.cpp(61): error C2039: 'add_edge': is not a member of 'boost::labeled_graph' 1>d:\data\boost\boost\libs\graph\example\labeled_graph.cpp(57): note: see declaration of 'boost::labeled_graph' ```

jzmaddock

The graph property of boost::no_property now serializes to two zeros. Added two zeros to kevin-bacon.dat.

deinst

examples crash when run

8

The following two examples crash at runtime: astar_maze.cpp kevin-bacon2.cpp Sorry but I don't see what the issue is off hand.

jzmaddock

Add missing check for 'degree' in BidirectionalGraphConcept. Fix the …

2

…concept checking class in the documentation for BidirectionalGraphConcept. Implementation of missing 'degree' function for filtered_graph. I'm going through other forks and came across this.

anadon

Title says it all, msvc runtime checks catch this.

jzmaddock