boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-29 19:42:11 +00:00
Code Issues Projects Releases Wiki Activity
1,685 Commits 115 Branches 134 Tags
bbd352bd579eb8b100bc5d4febb1ffed65458ed5
Commit Graph

1685 Commits

This Branch
This Branch
All Branches
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
216a5a7f12 Do not use atoi, atof 
[SVN r26938]
 2005-01-30 17:12:45 +00:00
Douglas Gregor
7fecf688bc Reduce reliance on test lib 
[SVN r26894]
 2005-01-28 08:08:18 +00:00
Douglas Gregor
ef5fdd8cc6 Document some known problems 
[SVN r26892]
 2005-01-28 07:44:25 +00:00
Douglas Gregor
bc931e3286 Remove extra template parameters 
[SVN r26887]
 2005-01-28 07:06:18 +00:00
Douglas Gregor
48d9ef8f54 Deal with min/max issues on Windows 
[SVN r26797]
 2005-01-21 22:47:58 +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
111151a177 Add umlaut 
[SVN r26764]
 2005-01-20 20:53:58 +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
01f0eb9ad3 Fixes from François Dumont 
[SVN r26693]
 2005-01-14 05:33:42 +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
867851b81f Try to work around GCC 2.95.3 issue with min 
[SVN r26603]
 2004-12-29 16:41:15 +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
bec9d1c8df Switch random generator to minstd_rand 
[SVN r26569]
 2004-12-21 20:17:18 +00:00
Douglas Gregor
bf9af6d93a Gursoy-Atun layout 
[SVN r26567]
 2004-12-21 19:59:37 +00:00
Douglas Gregor
e92cb8cf50 Better describe the result of add_edge 
[SVN r26565]
 2004-12-21 16:21:38 +00:00
Douglas Gregor
5b13bec33a Deal with stupid compilers that have min and max macros 
[SVN r26564]
 2004-12-21 13:48:29 +00:00
Victor A. Wagner Jr.
65f8821e60 Changed - all the \r only to \r\n on windows. CVS should get things all fixed up now 
[SVN r26561]
 2004-12-20 22:43:49 +00:00
Douglas Gregor
dff6200ce2 Make num_edges/num_vertices behavior much more explicit 
[SVN r26554]
 2004-12-20 15:40:35 +00:00
Douglas Gregor
1d39ccd924 Deal with max when it is a macro 
[SVN r26551]
 2004-12-20 04:57:04 +00:00
Douglas Gregor
28a1a88128 Bibliography entry for sequential_vertex_coloring 
[SVN r26535]
 2004-12-16 21:54:19 +00:00
Douglas Gregor
610cecce12 Work around issue with get() and GCC 3.4.3 
[SVN r26534]
 2004-12-16 16:50:52 +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
Vladimir Prus
fc3c19c664 Fix a typo 
[SVN r26527]
 2004-12-16 12:59:56 +00:00
Douglas Gregor
6b12a2813a Deal with min/max appropriately 
[SVN r26520]
 2004-12-15 21:57:13 +00:00
Douglas Gregor
ba2a9304e8 Don't include sys/time.h 
[SVN r26519]
 2004-12-15 21:41:43 +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
4ce0965553 Add Hyperworx platform 
[SVN r26516]
 2004-12-15 20:32:47 +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
Ronald Garcia
6a4cc8e537 missing close tag for betweenness_centrality link. 
[SVN r26499]
 2004-12-14 14:49:49 +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
604e5a7a45 Minor fixes and better output 
[SVN r26402]
 2004-12-02 16:29:55 +00:00
Aleksey Gurtovoy
3ec6d263b8 merge RC_1_32_0 tab fixes 
[SVN r26327]
 2004-11-28 03:27:25 +00:00
Douglas Gregor
48a0aff91d Add type -> const_type conversion to the challenge list 
[SVN r26289]
 2004-11-25 07:52:43 +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
945fb8717c Mention change to undirected_dfs 
[SVN r26285]
 2004-11-24 17:23:47 +00:00
Douglas Gregor
98187feda4 Converted interior properties example to use bundled properties 
[SVN r26284]
 2004-11-24 17:23:31 +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
26e586237e Fix typos 
[SVN r26188]
 2004-11-11 18:30:05 +00:00