boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-21 15:12:20 +00:00
Code Issues Projects Releases Wiki Activity
1,733 Commits 115 Branches 134 Tags
426d8e1244ba75cfec00e8fa8c22f618b34a9d24
Commit Graph

175 Commits

Author SHA1 Message Date
Douglas Gregor
9203aaf140 Compiler workarounds 
[SVN r27583]
 2005-03-08 20:29:29 +00:00
Douglas Gregor
0c1817ada1 More tests 
[SVN r27581]
 2005-03-08 19:34:53 +00:00
Douglas Gregor
1e359e31ed Input file for biconnected_components example 
[SVN r27558]
 2005-03-04 23:47:57 +00:00
Douglas Gregor
f237b9feee Biconnected components support 
[SVN r27557]
 2005-03-04 23:47:10 +00:00
Douglas Gregor
4a0081feb3 BSF and Dijkstra example and test 
[SVN r27553]
 2005-03-04 15:01:50 +00:00
Douglas Gregor
a6f984b406 Add Ron Garcia's new GraphViz parser. 
[SVN r27250]
 2005-02-08 18:58:24 +00:00
Stefan Slapeta
81703b0fb5 fixed some minor issues 
[SVN r27240]
 2005-02-08 12:46:40 +00:00
Stefan Slapeta
500be67439 Replaced BOOST_TEST 
[SVN r27050]
 2005-02-03 12:27:14 +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
48d9ef8f54 Deal with min/max issues on Windows 
[SVN r26797]
 2005-01-21 22:47:58 +00:00
Douglas Gregor
01f0eb9ad3 Fixes from François Dumont 
[SVN r26693]
 2005-01-14 05:33:42 +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
867851b81f Try to work around GCC 2.95.3 issue with min 
[SVN r26603]
 2004-12-29 16:41:15 +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
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
1d39ccd924 Deal with max when it is a macro 
[SVN r26551]
 2004-12-20 04:57:04 +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
ba2a9304e8 Don't include sys/time.h 
[SVN r26519]
 2004-12-15 21:41:43 +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
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
5f9800a0a7 Testcase illustrating a problem with brittle edge indices in bidirectional graphs with EdgeListS=vecS 
[SVN r25897]
 2004-10-27 16:40:55 +00:00
Douglas Gregor
71b302bc49 Merge from graph_devel_1_33_0 branch 
[SVN r25893]
 2004-10-27 14:38:15 +00:00
Jeremy Siek
9197a1028f added copyrights 
[SVN r25810]
 2004-10-20 13:20:19 +00:00
Douglas Gregor
896c715e35 using namespace boost should work around some issues for MIPSpro 
[SVN r25401]
 2004-09-25 13:20:24 +00:00
Douglas Gregor
3b9071cf27 Stupid limits include 
[SVN r25159]
 2004-09-16 19:58:18 +00:00
Douglas Gregor
e7706a3320 Need to have the betweenness centrality test here 
[SVN r25158]
 2004-09-16 19:57:58 +00:00
Douglas Gregor
b89568dcc5 Renamed 
[SVN r25083]
 2004-09-14 12:30:48 +00:00
Douglas Gregor
b7d9331f0e Make the Graph library pass inspection 
[SVN r25045]
 2004-09-13 15:36:39 +00:00
Douglas Gregor
95eeae244b Various fixes for vc7 and Linux 
[SVN r24853]
 2004-09-01 16:35:57 +00:00
Douglas Gregor
ce9e9e0d89 Fix a bunch of little bugs 
[SVN r24720]
 2004-08-24 21:40:31 +00:00
Douglas Gregor
103a676163 Show output for layout test 
[SVN r24719]
 2004-08-24 20:33:51 +00:00
Douglas Gregor
f2a534bf12 Don't use fabs 
[SVN r24505]
 2004-08-16 14:12:14 +00:00
Douglas Gregor
3082cb5195 Add copyright/license 
[SVN r24503]
 2004-08-16 13:59:51 +00:00
Douglas Gregor
83ed711d3c Whackin' a few buglets 
[SVN r24451]
 2004-08-13 02:53:11 +00:00
Douglas Gregor
e0356c30ca Moved to BSL 
[SVN r24450]
 2004-08-12 19:12:28 +00:00
Douglas Gregor
836a69685b Merged the well-tested algorithms on the graph_devel branch to trunk 
[SVN r24414]
 2004-08-11 15:30:20 +00:00
Douglas Gregor
6965fc78ba Ported to LEDA 4.5 
[SVN r24302]
 2004-08-05 13:38:36 +00:00
Douglas Gregor
d017d8e9e7 Converted to Boost Software License, Version 1.0 
[SVN r24096]
 2004-07-27 03:43:34 +00:00
Rene Rivera
db84792f9f Remove tabs in file. 
[SVN r24043]
 2004-07-25 17:12:17 +00:00
Douglas Gregor
656b0ce32d Doug Gregor->Douglas Gregor 
[SVN r24018]
 2004-07-25 02:59:30 +00:00
Douglas Gregor
d4125b58f9 Use Boost.Test 
[SVN r23800]
 2004-07-19 15:54:50 +00:00
Vladimir Prus
4adbd15346 More V2 Jamfile tweaks. 
[SVN r23764]
 2004-07-19 07:12:45 +00:00
Jeremy Siek
4c469946fe added a second test with no properties 
[SVN r23287]
 2004-06-30 16:08:33 +00:00
Jeremy Siek
10b91f71d1 bug in bidirectional graph remove_edge(e, g) 
[SVN r23286]
 2004-06-30 15:48:20 +00:00
Douglas Gregor
51d60f9b43 libs/graph/test/edge_list_cc.cpp: Specify all parameters, for VC7 support 
libs/graph/test/isomorphism.cpp: Deal with atoi/atof missing from std::
boost/graph//adjacency_matrix.hpp: deal with missing allocator<T>::rebind
boost/graph/graph_test.hpp: Remove unusable default constructor (workaround)
boost/graph/vector_as_graph.hpp: When we say remove, we mean std::remove
status/explicit-failures-markup.xml: mark everything I can't or won't fix


[SVN r23237]
 2004-06-29 02:30:29 +00:00
Douglas Gregor
cbfc6ec8ed Don't use std::atoi and std::atof directly 
[SVN r23217]
 2004-06-27 21:06:37 +00:00