2
0
mirror of https://github.com/boostorg/graph.git synced 2026-01-30 20:02:12 +00:00
Commit Graph

855 Commits

Author SHA1 Message Date
Douglas Gregor
bbd352bd57 Give queue a swap()
[SVN r27043]
2005-02-02 18:59:11 +00:00
Douglas Gregor
558b1a2fef Always include algorithm header, for swap
[SVN r26939]
2005-01-30 17:14:46 +00:00
Douglas Gregor
bc931e3286 Remove extra template parameters
[SVN r26887]
2005-01-28 07:06:18 +00:00
Douglas Gregor
0dc01eca8c Do not use log2, which is C99-only
[SVN r26765]
2005-01-20 21:21:44 +00:00
Douglas Gregor
56bfe6f4b7 Fix node movement for weighted graphs and update documentation
[SVN r26763]
2005-01-20 20:52:46 +00:00
Douglas Gregor
02635807ce Added contains() method to check if a heap contains a certain element
[SVN r26625]
2005-01-04 15:17:40 +00:00
Douglas Gregor
2ffc396f29 boost/pending/relaxed_heap.hpp:
- Relaxed heap data structure implementation

boost/graph/dijkstra_shortest_paths.hpp:
  - Use relaxed heap, with a debugging option allowing one to use the binary
    heap instead

libs/graph/test/relaxed_heap_test.cpp:
  - Comprehensive test of the relaxed heap

libs/graph/test/dijkstra_heap_performance.cpp:
  - Test the performance of the relaxed heap against the binary heap via
    Erdos-Renyi graphs.

libs/graph/test/Jamfile:
  - Introduce tests of relaxed heap

libs/graph/doc/dijkstra_shortest_paths.html:
  - Updated complexity to O(V log V), finally!
  - Cite relaxed heaps paper

libs/graph/doc/bibliography.html:
  - Added relaxed heap reference

index.htm, libs/graph/doc/history.html:
  - Announce introduction of relaxed heap


[SVN r26623]
2005-01-04 14:34:45 +00:00
Douglas Gregor
77ff4c53b8 Fixes for x86 Solaris
[SVN r26622]
2005-01-04 14:20:02 +00:00
Douglas Gregor
f2a49988ce Work around bug in GCC 2.95.3 standard library
[SVN r26604]
2004-12-29 16:53:05 +00:00
Douglas Gregor
5c155ac7a5 Blindly try to work around a CW bug
[SVN r26602]
2004-12-29 16:36:56 +00:00
Douglas Gregor
bf9af6d93a Gursoy-Atun layout
[SVN r26567]
2004-12-21 19:59:37 +00:00
Douglas Gregor
5604226901 Fixed, documented, and tested sequential_vertex_coloring
[SVN r26533]
2004-12-16 15:50:31 +00:00
Douglas Gregor
f27670da66 Move remove_directed_edge_dispatch up, thanks to Jurgen Hunold
[SVN r26529]
2004-12-16 14:03:02 +00:00
Douglas Gregor
6b12a2813a Deal with min/max appropriately
[SVN r26520]
2004-12-15 21:57:13 +00:00
Douglas Gregor
a6d2c98a5f Add support for vertex_id parameter to write_graphviz
[SVN r26517]
2004-12-15 20:57:35 +00:00
Douglas Gregor
eae6dc4a8e - Fixed remove_out_edge_if for undirected graphs.
- Make in_degree work for undirected graphs


[SVN r26515]
2004-12-15 20:32:23 +00:00
Douglas Gregor
f1278dca9f Rearrange detail namespace to get rid of order dependencies in function lookup, I hope
[SVN r26441]
2004-12-06 04:14:40 +00:00
Douglas Gregor
30ef8f84ff Graphs with zero vertices have zero connected components
[SVN r26403]
2004-12-02 16:32:05 +00:00
Douglas Gregor
a1078197fd Use union_set, not link, in incremental_components
[SVN r26288]
2004-11-25 07:39:21 +00:00
Douglas Gregor
2d2a71f7aa Add missing include
[SVN r26287]
2004-11-25 06:44:10 +00:00
Douglas Gregor
f2a278fad5 Fix parallel edge removal bug
[SVN r26286]
2004-11-25 06:33:10 +00:00
Douglas Gregor
9dd1992a9d Data-recursive undirected_dfs from Synge Todo
[SVN r26283]
2004-11-24 17:01:22 +00:00
Douglas Gregor
0c82c42f3d Initialize the predecessor map, dummy
[SVN r26232]
2004-11-18 15:51:29 +00:00
Douglas Gregor
9297879774 Fix for edge function provided by Eyal Farago
[SVN r26231]
2004-11-18 15:48:32 +00:00
Douglas Gregor
d34fed2e2a Add root_vertex support to Bellman-Ford shortest paths
[SVN r26189]
2004-11-11 19:34:35 +00:00
Douglas Gregor
8c2a5290ad index.htm, libs/graph/doc/table_of_contents.html:
- Document the existence of the biconnected components algorithm

libs/graph/example/biconnected_components.cpp:
  - Clean up the GraphViz output a bit

libs/graph/doc/figs/biconnected.dot, libs/graph/doc/figs/biconnected.png,
libs/graph/doc/biconnected_components.html:
  - Documentation for biconnected components and articulation points

boost/graph/biconnected_components.hpp:
  - Minor type tweaks


[SVN r26105]
2004-11-03 15:40:09 +00:00
Douglas Gregor
e7023ea88a boost/graph/biconnected_components.hpp:
- Fixed computation of articulation points

libs/graph/example/biconnected_components.cpp:
  - Remove the second example graph: we only need one for a good example

libs/graph/test/biconnected_components_test.cpp, libs/graph/test/Jamfile:
  - Randomized testcase verifying the biconnected components & articulation
    points computation. Biconnected components aren't thoroughly tested,
    but articulation points are.


[SVN r26094]
2004-11-03 05:02:30 +00:00
Douglas Gregor
6123fb57e9 boost/graph/biconnected_components.hpp:
- Added support for emitting articulation points (they come for free)
  - Eliminated unused parameters in public interface
  - Provided helper overloads that build the lowpt and discovertime property
    maps themselves.
  - Added articulation_points function that computes only articulation points
    (edge components not included)

libs/graph/example/biconnected_components.cpp:
  - Use some of the new overloads
  - Output articulation points as filled circles


[SVN r26091]
2004-11-02 22:34:26 +00:00
Douglas Gregor
5aa64b9cac Minor fixes
[SVN r26024]
2004-10-31 19:55:15 +00:00
Douglas Gregor
17985eaec5 Use appropriate grid cell size
[SVN r25918]
2004-10-28 15:31:42 +00:00
Douglas Gregor
71b302bc49 Merge from graph_devel_1_33_0 branch
[SVN r25893]
2004-10-27 14:38:15 +00:00
Douglas Gregor
63cfb2e00b Perform fast removal of edges in bidirectional graphs
[SVN r25868]
2004-10-26 01:05:11 +00:00
Douglas Gregor
8d219e56bc Fix assignment from *this
[SVN r25820]
2004-10-21 15:52:28 +00:00
Jeremy Siek
4b6effe849 added copyrights
[SVN r25809]
2004-10-20 13:07:46 +00:00
Joaquín M. López Muñoz
2341889e69 taken care of BOOST_NO_STDC_NAMESPACE
[SVN r25294]
2004-09-21 09:58:24 +00:00
Douglas Gregor
0b782a2f7f Work around the lack of a <limits> header
[SVN r25091]
2004-09-14 21:28:18 +00:00
Douglas Gregor
6c7a79387a Work around VC library bug
[SVN r25089]
2004-09-14 21:23:36 +00:00
Douglas Gregor
264620c744 Try to deal with platforms that don't move sin and cos into namespace std
[SVN r25087]
2004-09-14 21:01:04 +00:00
Douglas Gregor
fde46d6ee8 Fix BC include
[SVN r25060]
2004-09-13 18:14:14 +00:00
Douglas Gregor
b7d9331f0e Make the Graph library pass inspection
[SVN r25045]
2004-09-13 15:36:39 +00:00
Douglas Gregor
1b13e37ec2 Attempt at IBM xlC workaround
[SVN r25024]
2004-09-13 00:16:35 +00:00
Douglas Gregor
41e4d297e8 Attempt at IBM xlC workaround
[SVN r25023]
2004-09-13 00:16:03 +00:00
Douglas Gregor
d84342b076 Fix a silly typo
[SVN r24873]
2004-09-02 14:59:32 +00:00
Douglas Gregor
95eeae244b Various fixes for vc7 and Linux
[SVN r24853]
2004-09-01 16:35:57 +00:00
Douglas Gregor
ed11fbce92 VC7 can handle member templates; let it
[SVN r24723]
2004-08-24 22:01:04 +00:00
Douglas Gregor
e6c0a0b36e Use boost::optional to avoid copying singular iterators
[SVN r24721]
2004-08-24 22:00:33 +00:00
John Maddock
0f54780d9b Converted files to the BSL.
[SVN r24614]
2004-08-20 11:10:24 +00:00
Douglas Gregor
5e84be1a7d boost/graph/kamada_kawai_spring_layout.hpp:
- Use T, not double, in layout_tolerance
  - Make layout_tolerance use _relative_ tolerances, only
  - Make default tolerance 0.001, which returns some pleasing graphs

libs/graph/doc/layout_tolerance.html:
  - Document changes


[SVN r24608]
2004-08-19 21:50:19 +00:00
Douglas Gregor
455dae4bfe Test for disconnected graphs and document the change
[SVN r24541]
2004-08-17 21:53:49 +00:00
Douglas Gregor
667f926d1c Really, don't use fabs
[SVN r24540]
2004-08-17 21:33:07 +00:00