2
0
mirror of https://github.com/boostorg/graph.git synced 2026-01-19 04:12:11 +00:00
Commit Graph

665 Commits

Author SHA1 Message Date
Jan-Grimo Sobez
4697f3fb19 Update file paths 2025-05-09 22:07:47 +02:00
Jan-Grimo Sobez
4aec705625 Merge branch 'develop' into fix-github-428 2025-05-06 07:20:19 +02:00
Rene Rivera
7b9640389c Sync from upstream. 2025-05-01 21:44:03 -05:00
Jan-Grimo Sobez
f434208542 Fix multiplicity value comparison
Fix multiplicity value comparison
- Replacement of at() in 8f3139be as part of #349 was faulty: Iterator
deref is a (key, value) pair, but only the value should be compared
2025-05-01 16:32:43 +02:00
Rene Rivera
823e17fb44 Tests no longer depend on Boost.Assign. 2025-04-12 23:10:50 -05:00
Joris van Rantwijk
be7434e584 Specify path of weighted_matching.dat via Jamfile 2025-04-05 12:02:25 +02:00
Rene Rivera
258f47a3b1 Sync from upstream. 2025-04-04 21:39:36 -05:00
Pavel Samolysov
e936b09340 Add a test case for adjacency_matrix 2025-03-01 16:29:06 +03:00
Pavel Samolysov
38b4f317a8 Add a test case for adjacency_list< listS, vecS, bidirectionalS >
This specialization of the adjacency_list class uses different value
for `graph_traits< G >::null_vertex()`.
2025-03-01 14:21:49 +03:00
Jeremy W. Murphy
9237081239 Merge pull request #403 from Wavetrace/feature-matrix-bidir
Make adjacency_matrix implement BidirectionalGraph concept
2025-02-28 16:07:00 +09:00
Jeremy W. Murphy
d5531e24dc Merge pull request #418 from gogagum/feature/remove-boost-bind-usages
Remove Boost.Bind usages, replace with lambda
2025-02-18 18:50:34 +11:00
Georgy Guminov
2d182cff02 Remove all std::bind usages. 2025-02-17 21:13:30 +03:00
Jeremy W. Murphy
167ac18ae7 Merge pull request #400 from jorisvr/matching_joris
Replace implementation of maximum_weighted_matching()

Based on a paper by Zvi Galil. The new code runs in time O(V^3).
2025-02-10 11:26:52 +09:00
Joris van Rantwijk
3db393b6fd Remove unnused #include 2025-02-06 20:09:38 +01:00
Georgy Guminov
8696a1fdc2 Remove Boost.Assign usages. 2025-02-06 00:43:03 +03:00
Joris van Rantwijk
69f393a08b Rewrite "typedef" as "using"
Also remove unnecessary < > spaces around template arguments.
2025-02-05 21:12:34 +01:00
Joris van Rantwijk
6396f826d3 Remove random test cases 2025-02-05 19:21:39 +01:00
Anthony Van Herrewege
1c295e6830 Ensure named_graph base class is initialized before accessing it 2025-02-03 15:36:24 +01:00
Jeremy W. Murphy
84c36ca5f9 Merge pull request #412 from jeremy-murphy/388_is_straight_line_drawing
Fix geometry bug in is_straight_line_drawing
2025-01-27 08:22:46 +11:00
Joris van Rantwijk
c8bd42dd53 Fix include order after review 2025-01-26 12:04:59 +01:00
Joris van Rantwijk
f30ba13a24 Add more tests for maximum_weighted_matching
- Hand-picked graphs to explore basic functionality.
- Graphs that are known to trigger bugs in the old
  implementation of maximum_weighted_matching().
- Random small graphs.
2025-01-13 21:32:38 +01:00
Peter Kerzum
b0be1f7087 Make adjacency_matrix implement BidirectionalGraph concept
Adjacency matrix is by nature bidirectional and one can see that the
concept was mostly implemented before. That implementation missed
the degree function(s). These functions are implemented in this commit
and the traversal_category is updated to meet the concept requirements.

Tests are also added, though they are a bit shallow in the sense that
they seem to omit intensive algorithms.
2024-12-12 03:33:26 +01:00
Joris van Rantwijk
f98edae416 weighted_matching_test check input file
Without this check, the test program declares all tests passed if it
fails to open the input file.
2024-12-03 21:38:27 +01:00
Peter Dimov
f1e51a0857 Add CMake subdir and install tests to ci.yml 2024-11-07 10:36:23 +02:00
Hermann-SW
bda28c863a add failing is_straight_line_drawing testcase 2024-10-12 19:35:43 +02:00
Daniel Yang
b671e3d5e6 added test for checking dfs_visitor callbacks in undirected_dfs 2024-10-09 09:29:28 +02:00
Rene Rivera
a9516ad819 Update build deps. 2024-08-03 12:29:04 -05:00
Rene Rivera
6b09e7b7e3 Sync from upstream. 2024-05-10 20:46:30 -05:00
sehe
05aa9fd816 Include test for subgraph nesting limit
Eliminating need for manual re-test after review updates PR #376
2024-05-08 15:41:04 +02:00
sehe
9c0ceda4c8 test_subgraphs verifies (keyword) subgraphs parse 2024-05-08 14:48:06 +02:00
sehe
8126d97989 refactoring graphviz_test for review
The code was mostly fine (except for unhygienic `using namespace` in
places), but it was hard to see what was covered.

I've seperated fixtures (sample input + expected output) and this will
simplify invoking the ComparisonDriver (test_graph).
2024-05-08 14:43:53 +02:00
sehe
2154398906 Review comments 2024-05-08 14:39:27 +02:00
sehe
b8150fac82 Restore broken test_basic_csr_directed_graph
Works around invalidation of bundle property maps (see #373).

The `#if SEHE_UNSTABLE_PROPERTY_MAPS_FIXED` section is there to signal
my intent to investigate a generalized fix under that issue. It doubles
as literate documentation of the need for the workaround, so it's less
likely to bite the unwary.
2024-05-03 04:20:45 +02:00
Rene Rivera
e0d11417c5 Sync from upstream. 2024-04-20 15:32:18 -05:00
Jiachen Dong
81ead6e595 Fix typo in name adjacenct_vertices. 2024-04-12 17:17:15 +08:00
Rene Rivera
fe90a5b067 Sync from upstream. 2024-04-10 07:56:28 -05:00
andrea-cassioli-maersk
fa8caeeffa fix wrong naming 2024-04-03 16:07:08 +02:00
andrea-cassioli-maersk
33a2510c54 Update rcsp_single_solution.cpp 2024-03-22 11:00:59 +01:00
andrea-cassioli-maersk
57fdbf4093 Update rcsp_single_solution.cpp 2024-03-22 10:31:14 +01:00
andrea-cassioli-maersk
46a2823a94 fix issue in the single solution rcsp 2024-03-22 10:04:32 +01:00
Rene Rivera
3d5eba2410 Make the library modular usable. 2024-03-11 08:38:17 -05:00
Andrey Semashev
a052dcdd06 Updated Boost.Filesystem usage.
This commit updates tests to avoid using Boost.Filesystem APIs that
were deprecated and then removed.
2024-01-27 00:35:52 +03:00
Romain Geissler
e522561485 Remove link against boost regex library, as normally it is header only when using C++ >= 11. 2023-12-08 00:00:37 +00:00
George Williams
e94408cf41 test/labeled_graph: added test for multiple associative container 2023-11-27 13:42:58 -05:00
George Williams
8dc51f8bdc test/labeled_graph: added test for removing a labeled vertex 2023-11-20 08:41:55 -05:00
Jan-Grimo Sobez
2097d8ffed Replace lowest with min for int case 2023-07-09 15:56:24 +02:00
Jan-Grimo Sobez
98e7bfa10a Isomorphism: Map disconnected vertices
Isomorphism: Map disconnected vertices
- Adds O(V) algorithm at return_point_true to match disconnected
  vertices in the isomorphism map
- Adds colored isomorphism test ensuring no null vertices are in the
  isomorphism map
2023-07-09 15:56:24 +02:00
Sven Gato Redsun
0182f7490e Generalize comments to be valid for any values of N and P 2023-05-07 22:02:19 -06:00
Sven Gato Redsun
05e099335a Make comments match actual values of the random graph's number of vertices and probability of edge connection 2023-05-07 20:24:48 -06:00
Jeremy W. Murphy
5ef6a074e7 Merge pull request #315 from svengato/develop
Optionally specify a maximum circuit length in Hawick circuits algorithm
2023-05-08 11:57:33 +10:00