2
0
mirror of https://github.com/boostorg/graph.git synced 2026-01-24 18:02:19 +00:00

471 Commits

Author SHA1 Message Date
Jeremiah Willcock
801a11bf4a Merged in changes from trunk for Boost.Graph and Boost.PropertyMap. Includes
r56013, r56014, r56015, r56016, r56017, r56089, r56097, r56116, r56117, r56126,
r56127, r56128, r56140, r56147, r56300, r56301, r56339, r56360, r56454, r56473,
r56563, r56651, r56654, r56658, r56682, r56732, r56796, r56855, r56856, r56868,
r55667, r56860, r55473, r55507, r55528, r55749, r56147, r55723, r56109, r56859,
and r55780.


[SVN r56881]
2009-10-15 20:40:46 +00:00
Jeremiah Willcock
a7a18787e9 Applied fixes for bugs; fixes #3409, #3414, #3415, #3416
[SVN r56089]
2009-09-07 14:55:38 +00:00
Jeremiah Willcock
4e015739c4 Added fixes to and a test for incremental_components from Michael Hansen; fixes #3250
[SVN r56015]
2009-09-04 14:49:24 +00:00
Jeremiah Willcock
f87613ea1b Added grid graph from Michael Hansen
[SVN r55473]
2009-08-08 18:58:07 +00:00
Jeremiah Willcock
33af3494f7 Merged in changes from trunk
[SVN r55467]
2009-08-08 18:19:53 +00:00
Jeremiah Willcock
0b53b0b00a Fixed tab issues found by inspect tool
[SVN r55027]
2009-07-19 15:32:27 +00:00
Andrew Sutton
083d6b83aa Integrated new implementation of howard's cycle ratio algorithm. It's an
optimization and cleanup from the older version. Note that this breaks
source compatability in one instance.


[SVN r54999]
2009-07-17 14:56:19 +00:00
Jeremiah Willcock
b0e4e9fa01 Merged patches mentioned in comments 34-53 from ticket 3134 into release branch; refs #3134
[SVN r54540]
2009-06-30 17:08:49 +00:00
Jeremiah Willcock
5a01455ca3 Added example for McGregor algorithm from Michael Hansen; refs #3134; fixes #694
[SVN r54342]
2009-06-25 16:51:17 +00:00
Jeremiah Willcock
686376231a Added more updates, docs, and tests from Michael Hansen
[SVN r53327]
2009-05-27 20:54:24 +00:00
Andrew Sutton
71c8ff92a2 Added copyright/licence.
[SVN r53129]
2009-05-20 14:41:03 +00:00
Andrew Sutton
3217880ec2 Removing example from build.
[SVN r52982]
2009-05-14 00:42:13 +00:00
Andrew Sutton
6365853620 Removing missing file from build.
[SVN r52978]
2009-05-13 21:57:42 +00:00
Andrew Sutton
ebc735f49e Added missing labeled graph file.
[SVN r52964]
2009-05-13 11:49:42 +00:00
Andrew Sutton
da1172f268 Cleaning up some build issues in the imoprted examples.
[SVN r52918]
2009-05-11 17:45:47 +00:00
Andrew Sutton
c57722a10f Migrating all examples into example directory
[SVN r52509]
2009-04-20 14:34:59 +00:00
Jeremiah Willcock
e674c8b9c7 Replaced non-ASCII names with ASCII approximations
[SVN r52295]
2009-04-09 15:27:50 +00:00
Jeremiah Willcock
8d4c3cc7d6 Moved property map library into property_map/ directory; made old files into stubs with #warnings; converted uses and docs of property map library to use new names
[SVN r52226]
2009-04-07 01:28:38 +00:00
Jeremiah Willcock
83e3ee4b6c Reverted r14604 to test handling of unconnected vertices, and fixed up formatting of output grid
[SVN r50821]
2009-01-27 21:12:42 +00:00
Jeremiah Willcock
50fba1d79f Tightened handling of inf in example to try to catch problems like #732 in the future
[SVN r50816]
2009-01-27 20:19:55 +00:00
Jeremiah Willcock
86fb16b3b8 Fixed inspection report problems
[SVN r50706]
2009-01-21 18:59:38 +00:00
Ronald Garcia
3644e4d51a Initial Revision. Based on read_graphviz.cpp.
[SVN r47240]
2008-07-08 17:24:20 +00:00
Douglas Gregor
bb1977b17a Resource-constrained shortest paths, from Michael Drexl
[SVN r44717]
2008-04-22 12:24:25 +00:00
K. Noel Belcourt
40af610e8f Fixes #416
Fixed spelling of Jack Edmonds name and renamed files
where necessary.  Updated the documentation as well.
Tested changes by building/running tests in libs/graph/test.



[SVN r42984]
2008-01-26 18:35:59 +00:00
Douglas Gregor
23ca414964 Merge in Boost.Graph changes from RC_1_34_0 branch
[SVN r40813]
2007-11-05 21:43:24 +00:00
Douglas Gregor
c09b24159b Removed ancient BGL-Python code
[SVN r40812]
2007-11-05 21:25:10 +00:00
Aaron Windsor
e9747c0143 Un-asserted two function calls - this was causing the function calls to turn into no-ops when the example was compiled with debugging off.
[SVN r40167]
2007-10-19 00:16:36 +00:00
Ronald Garcia
2f99e5b87f Initial Revision. Stolen from the write-graphviz.html docs.
[SVN r39523]
2007-09-25 15:32:23 +00:00
Aaron Windsor
8dfc1ad52c merging planar graph algorithms into the BGL
[SVN r38956]
2007-08-25 21:11:06 +00:00
Douglas Gregor
d0432740ef Maximum and minimum cycle ratio
[SVN r38308]
2007-07-30 13:01:16 +00:00
Aaron Windsor
7e7359b330 changing name of maximum_cardinality_matching.hpp
[SVN r36366]
2006-12-14 00:49:22 +00:00
Douglas Gregor
1cfa23497b Integrate Kolmogorov's max flow algorithm, from Stephan Diederich.
[SVN r36125]
2006-11-20 23:42:44 +00:00
Ronald Garcia
3ae3292696 Initial Revision.
[SVN r35637]
2006-10-16 18:03:28 +00:00
Jeremy Siek
73b6ddc2d4 fixed has_cycle_dfs
[SVN r35026]
2006-09-06 17:26:48 +00:00
Daniel James
d4db30f9d3 Merge tab removal.
[SVN r34995]
2006-08-29 20:59:37 +00:00
Douglas Gregor
a4a5a1a42b Add dummy Directed parameter to the CSR graph
[SVN r33291]
2006-03-09 20:06:23 +00:00
Douglas Gregor
d0176ea39d Fix call to dijkstra_shortest_paths_no_init
[SVN r32385]
2006-01-23 20:57:32 +00:00
Jeremy Siek
e5a0f4f5fc blah
[SVN r32251]
2006-01-06 22:09:01 +00:00
Jeremy Siek
727a9d994d minor edit
[SVN r32248]
2006-01-06 22:02:52 +00:00
Jeremy Siek
f836ed2531 updated version of the kevin bacon example to use serialization
[SVN r32246]
2006-01-06 21:44:58 +00:00
Douglas Gregor
aa3dcfb2e1 Add example for CSR graph
[SVN r31880]
2005-12-02 15:24:02 +00:00
Douglas Gregor
ba824058ef edmonds_maximum_cardinality_matching, from Aaron Windsor
[SVN r30848]
2005-09-07 15:39:03 +00:00
Douglas Gregor
9294975522 Fix blips in inspection report
[SVN r29996]
2005-07-12 03:10:33 +00:00
Douglas Gregor
50bd84a168 Example
[SVN r29995]
2005-07-12 02:37:50 +00:00
Douglas Gregor
c3ec244c89 Documentation and example patch from Andreas Scherer
[SVN r28578]
2005-05-02 15:16:34 +00:00
Douglas Gregor
34bc3a8786 doc/*: Document Python bindings
src/python/basic_graph.cpp src/python/basic_graph.hpp:
  - Add ability to record the names of vertices input via the adjacency list
    reader.

example/python/breadth_first_search.py: Building a better example


[SVN r28350]
2005-04-20 23:45:55 +00:00
Douglas Gregor
631d35bcc2 Started documenting Python bindings
libs/graph/src/python/basic_graph.cpp, libs/graph/src/python/basic_graph.hpp:
  - Allow one to build a graph from anything that looks like a Python list or
    tuple.


[SVN r28324]
2005-04-19 17:01:07 +00:00
Douglas Gregor
4bc19a1621 boost/graph/cuthill_mckee_ordering.hpp, boost/graph/king_ordering.hpp:
- Remove use of connected components, so we need only one color map
    running around
  - Provide simple overloads, requiring only the graph and the output iterator.

boost/graph/detail/sparse_ordering.hpp:
  - Move out_degree_property_map here

boost/graph/fruchterman_reingold.hpp:
  - Fix enumeration of pairs in grid_force_pairs to repulse vertices in
    adjacent grid cells (in addition to the current cell), so we don't get
    vertices forming crosses on grid lines.
  - Round up the number of rows/columns.

libs/graph/doc/cuthill_mckee_ordering.html, libs/graph/doc/king_ordering.html:
  - Document new overloads

libs/graph/doc/gursoy_atun_layout.html:
  - Add missing semicolon

libs/graph/src/python/cuthill_mckee_ordering.cpp,
libs/graph/test/cuthill_mckee_ordering.cpp:
  - Test and use the new overloads

libs/graph/build/python/Jamfile, libs/graph/src/python/module.cpp,
libs/graph/src/python/king_ordering.cpp:
  - Support King's ordering algorithm from Python

libs/graph/example/python/vis.py:
  - By default, do a "progressive" Fruchterman-Reingold layout

libs/graph/test/king_ordering.cpp:
  - Test new overload


[SVN r28306]
2005-04-17 23:50:43 +00:00
Douglas Gregor
cfb03e5e10 Work around MSVC6 bugs
[SVN r28258]
2005-04-14 23:14:00 +00:00
Douglas Gregor
9eb9501c27 boost/graph/cuthill_mckee_ordering.hpp:
- Support for multiple components
  - Recast as invocation of breadth_first_search

boost/graph/king_ordering.hpp:
  - King's algorithm for sparse matrix ordering

boost/graph/detail/sparse_ordering.hpp:
  - Details for the sparse matrix ordering algorithms

libs/graph/example/king_ordering.cpp,
libs/graph/example/cuthill_mckee_ordering.cpp:
  - Usage examples for the sparse matrix ordering algorithms

libs/graph/doc/bibliography.html, libs/graph/doc/cuthill_mckee_ordering.html,
libs/graph/doc/king_ordering.html:
  - Updated documentation to reflect new implementations

libs/graph/doc/history.html, index_1_33_0.htm:
  - Announcements


[SVN r27907]
2005-04-01 20:18:45 +00:00