boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-19 16:22:14 +00:00
Code Issues Projects Releases Wiki Activity
3,777 Commits 115 Branches 134 Tags
develop
Commit Graph

780 Commits

Author SHA1 Message Date
Andrea Cassioli
6df9717c84 Update doc/r_c_shortest_paths.html 
Co-authored-by: Jeremy W. Murphy <jeremy.william.murphy@gmail.com>
 2025-07-17 11:28:45 +02:00
Andrea Cassioli
7e1863ae10 Update r_c_shortest_paths.html 
Add few details about the on_enter_loop visitor event that is not documented
 2025-07-10 15:32:02 +02:00
Jeremy W. Murphy
8f05ca23fa Merge pull request #410 from Tuxliri/patch-1 
Fixed wrong link in grid_graph documentation
 2025-02-27 07:11:09 +09: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
88a4f855f2 Clarify algorithm doc after review 2025-01-31 08:29:08 +01:00
Joris van Rantwijk
13c5fd7011 Remove verification code 2025-01-30 19:25:50 +01:00
Joris van Rantwijk
26efe6629e Fix grammar in doc after review 2025-01-26 12:08:29 +01:00
Joris van Rantwijk
059365ffe8 Update maximum_weighted_matching documentation 2025-01-13 21:35:19 +01:00
Davide Iafrate
4d701e74f2 Fixed wrong link in grid_graph documentation 2024-12-25 12:43:59 +01:00
Joris van Rantwijk
ce24b257ca Fix time complexity spec of vertex() 2024-12-08 11:37:24 +01:00
Bruno Martinez
e0e3731ca6 Update publications.html 2024-09-22 12:22:44 -03:00
Jeremy W. Murphy
41d39a5162 Update disjoint_sets.html 
Remove unnecessary dir prefix
 2024-09-12 09:51:00 +10:00
Jeremy W. Murphy
3184d9a084 Fix broken link to disjoint_sets 2024-09-12 09:49:54 +10:00
Jeremy W. Murphy
212451425d Fix broken links to incremental components 2024-09-12 09:43:39 +10:00
Jan-Grimo Sobez
5ec4327816 Invariant contiguous range requirement removal 
Invariant contiguous range requirement removal
- Vertex invariants for use in isomorphism algorithm must no longer have
  low upper bounds due to a hidden allocation linear in the maximum
  encountered vertex invariant.
- Vertex invariants must no longer be convertible to `size_t`, but can
  be any comparable and hashable types
- Build `unordered_map`-backed invariant multiplicity map efficiently
  from sorted vertex invariants
 2024-04-14 09:48:36 +02:00
andrea-cassioli-maersk
72cad02a0b fix reverse graph example example broken link; fix rcsp functions parameters 2024-01-26 11:41:05 +01: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
Jeremy W. Murphy
77c07d131e Merge pull request #321 from derek-mcblane/fixup-challenge-doc 
Fix hyperlink for disjoint sets in "Challenge and To-Do Items"
 2023-09-12 13:32:15 +10:00
Jeremy W. Murphy
7a469ec47a Merge pull request #207 from jargonzombies/map-disconnected-vertices 
Isomorphism: Map disconnected vertices
 2023-09-04 13:00:16 +10:00
Jeremy W. Murphy
4fc6b0b65e Merge pull request #206 from jargonzombies/isomorphism-max-invariant 
Isomorphism: Replace vertex_max_invariant with internal calculation
 2023-07-18 15:06:54 +10:00
Jan-Grimo Sobez
9f36ca3a1d Add overflow assert and doc explanation for bound 2023-07-17 09:52:58 +02:00
Jan-Grimo Sobez
047fff647f Variable renames, doc update 2023-07-09 16:13:32 +02:00
Jan-Grimo Sobez
38efd9dc1d max_invariant initialization, expand doc 
max_invariant initialization
- Zero-initialize `max_invariant` and ensure no UB happens since
  `invar?_array` vecs may be empty if their corresponding graph is empty

expand doc
- More explanation on why `vertex_max_invariant` is ignored
 2023-07-07 20:34:20 +02:00
Jeremy W. Murphy
ee2cdcc805 Merge pull request #205 from jargonzombies/isomorphism-docs 
Isomorphism docs: AdaptableUnaryFn, null vertices
 2023-07-07 10:32:23 +10:00
Sven Gato Redsun
a07f3532ad Do not use 'const' with value parameters 2023-03-09 21:26:33 -07:00
Sven Gato Redsun
e17d6f9ff8 Use snake case (max_length) for style consistency 2023-03-09 18:17:35 -07:00
Derek McBlane
a3148837c2 fixed hyperlink for disjoint sets 2022-12-27 22:14:20 -05:00
Sven Gato Redsun
3f75ea7aa3 Optionally specify a maximum circuit length in Hawick circuits algorithm 2022-11-26 10:02:08 -07:00
Jesse Li
ea24532da5 Clarify docs on what traversal category allowed 2022-07-18 22:54:03 -07:00
Jeremy W. Murphy
0defbbc323 Merge pull request #277 from cvvergara/patch-1 
Add pgRouting to Boost Graph Library Users
 2022-01-04 12:58:12 +11:00
Ashish Kumar
b76ffc7f2a Typo fix in graph edge_coloring docs (#209) 2021-12-09 17:26:38 +11:00
Philip Allgaier
972bde3031 Fix minor doc typos (#270) 
* Fix typo in incident doc

* Add missing closing bracket to random_spanning_tree doc
 2021-12-09 17:22:10 +11:00
Vicky Vergara
4879e70593 Add pgRouting to Boost Graph Library Users 
First of all, I want to congratulate you for the amazing job you are doing.

I am the main developer of pgRouting, and the project is part of the OSGeo
Foundation [2] community projects.

pgRouting extends the PostGIS / PostgreSQL geospatial database to provide
geospatial routing functionality.

I would like pgRouting [1] to be added on the list of
"Boost Graph Library Users"
The Boost license is on the projects repository [3] and we document when a
boost graph function is used for example in [4]

[1] https://pgrouting.org/
[2] https://www.osgeo.org
[3] https://github.com/pgRouting/pgrouting
[4] https://docs.pgrouting.org/latest/en/pgr_aStar.html
 2021-11-12 09:49:11 -06:00
jzmaddock
5842a766b6 Merge pull request #236 from Myles1/fix-links 
fix graph library user manual links
 2021-04-20 18:57:38 +01:00
jzmaddock
9b425a037c Merge pull request #191 from valiko-ua/develop 
Fixed HTML and other errors in doc/graph_theory_review.html
 2021-04-20 10:47:28 +01:00
Myles1
f0c469b8e6 fix graph library user manual links 2020-12-21 18:39:49 -08:00
Jared Khan
ecbd271eb1 Fix minor typo in AdjacencyGraph docs 2020-03-17 16:31:08 +00:00
Jan-Grimo Sobez
e5f9471984 Isomorphism: Ignore vertex_max_invariant 
Isomorphism: Ignore vertex_max_invariant
- vertex_max_invariant and invariant2.max() are misnomers since what is
  expected is an upper exclusive bound on the possible invariant values,
  not their maximum value.
- The parameter can be ignored and the upper exclusive bound found
  cheaply at the start of test_isomorphism
- Removes the additional requirement of a nullary max member function on
  invariant2
 2020-02-16 11:21:45 +01:00
Jan-Grimo Sobez
70d7fca2ce Isomorphism docs: AdaptableUnaryFn, null vertices 
Isomorphism docs
- The expected concept for invariant functors is AdaptableUnaryFunction,
  not UnaryFunction
- Null vertices can appear in the isomorphism map output if both graphs
  contain disconnected vertices, add a note to that parameter's
  documentation
 2020-02-16 11:12:30 +01:00
Valentyn Shtronda
7c0a9d2998 One more correction of "Elementary Graph Theory" 2019-12-03 16:13:54 +02:00
Valentyn Shtronda
c1803bbb4f Some vertices were omitted 2019-11-27 04:26:23 +02:00
Valentyn Shtronda
545428a4d0 Grammar/formatting 2019-11-27 04:25:30 +02:00
Valentyn Shtronda
53d0e93e43 Added missing parts. 
Added parts that seems were lost long time ago during conversion to HTML.
 2019-11-27 04:22:38 +02:00
Valentyn Shtronda
1eb8c16a76 Fixed HTML. 2019-11-27 04:17:17 +02:00
jzmaddock
fa6871ef4d Merge branch 'whitespace_and_formatting' of https://github.com/anadon/graph into pr171_2 
Resolved Conflicts:
 include/boost/graph/one_bit_color_map.hpp
 include/boost/graph/two_bit_color_map.hpp
 2019-08-26 18:09:24 +01:00
Fábio Silva
daec2ee5e0 adjacency_list: Fix example broken link 
- family-tree-eg.cpp -> family_tree.cpp
 2019-06-09 22:17:43 -03:00
Josh Marshall
3fb1a64bd1 Shouldn't have modified the PDFs. 2019-05-02 16:37:09 -04:00
Josh Marshall
8747675e12 Applied clang-format and stripped all trailing whitespace. 2019-05-02 16:31:08 -04:00
jzmaddock
b3f9fa1284 Fix links in docs moved from disjoint_sets. 2019-05-02 18:31:24 +01:00
James E. King III
0978691c1f Integrate boostorg/disjoint_sets into boostorg/graph 2019-04-26 14:42:58 -04:00