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

838 Commits

Author SHA1 Message Date
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
Douglas Gregor
46e2920f70 Fix silly error pointed out by Gordon Smith 
[SVN r24537]
 2004-08-17 20:46:38 +00:00
Douglas Gregor
83ed711d3c Whackin' a few buglets 
[SVN r24451]
 2004-08-13 02:53:11 +00:00
Jeremy Siek
d32278ed01 fixed bug, p == nil() instead of p != nil() in update 
[SVN r24421]
 2004-08-11 19:56:32 +00:00
Douglas Gregor
0b137f41e2 Fixed some minor errors, but it is still broken 
[SVN r24415]
 2004-08-11 17:02:09 +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
Jeremy Siek
5de49c9ea3 added a copyright 
[SVN r24393]
 2004-08-10 18:44:34 +00:00
Douglas Gregor
d1be6c2495 boost/graph/leda_graph.hpp: 
- Ported to new iterator adaptors (actually, iterator_facade)
  - Ported to LEDA 4.5

libs/graph/example/leda-concept-check.cpp, libs/graph/example/leda-graph-eg.cpp
  - Ported to LEDA 4.5


[SVN r24301]
 2004-08-05 13:37:22 +00:00
Douglas Gregor
e4461f93d5 Qualify make_pair calls 
[SVN r24265]
 2004-08-03 10:50:26 +00:00
Douglas Gregor
d017d8e9e7 Converted to Boost Software License, Version 1.0 
[SVN r24096]
 2004-07-27 03:43:34 +00:00
Douglas Gregor
34fefcd0f6 Converted to Boost Software License, Version 1.0 
[SVN r24055]
 2004-07-26 00:32:12 +00:00
Douglas Gregor
008a8c7168 johnson_all_pairs_shortest.hpp: When writing into the distance map, we need 
to subtract one from the index in graph g2, which has an extra vertex "s" at
the beginning. Amazing how long this bug persisted...


[SVN r24044]
 2004-07-25 17:25:54 +00:00
Rene Rivera
f3d206f725 Remove tabs in file. 
[SVN r24041]
 2004-07-25 16:10:20 +00:00
Douglas Gregor
905969f542 Doug Gregor -> Douglas Gregor 
[SVN r24016]
 2004-07-25 02:29:29 +00:00
Vladimir Prus
598c2d2478 Do not copy default-constructed interator, which might be signular. 
[SVN r23841]
 2004-07-20 13:25:48 +00:00
Guillaume Melquiond
145474f398 finally corrected the iterator so that it stops at end of the adjacency matrix, also corrected the get_edge behavior between const and non-const matrix 
[SVN r23808]
 2004-07-19 20:11:43 +00:00
Guillaume Melquiond
29f3336462 return u-1 edges (rather than a random number) for undirected adjacency matrices 
[SVN r23694]
 2004-07-17 15:46:38 +00:00
Guillaume Melquiond
dd45b3d00f avoid dereferencing an end iterator 
[SVN r23692]
 2004-07-17 15:34:09 +00:00