Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add rank spanning branchings routine for possible inclusion in library. #82

Open
wants to merge 15 commits into
base: develop
Choose a base branch
from
Open

Add rank spanning branchings routine for possible inclusion in library. #82

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
15 commits
Select commit Hold shift + click to select a range
3b95d7f
Add rank spanning branchings routine, examples, tests, and documentat…
mbradle Aug 23, 2015
65ab91c
Rename cycle branching variable. Change to use boost::optional inste…
mbradle Nov 20, 2018
2d4f9af
Expand variable name.
mbradle May 19, 2019
3d9aa8a
Alias heap.
mbradle May 25, 2019
c2a8730
Add comments.
mbradle May 25, 2019
802e9de
Rename variables.
mbradle May 25, 2019
4b1f296
Merge remote-tracking branch 'upstream/develop' into dev. Update bib…
mbradle May 26, 2019
140d9bb
Rename variables. Change zero weight for example code.
mbradle May 28, 2019
3997129
Rename disjoint sets to better indicate their purposes.
mbradle May 29, 2019
2ca821e
Move SEEK. Simplify templates.
mbradle May 31, 2019
6d164c0
Change to reflect change in SEEK implementation.
mbradle May 31, 2019
9727258
Rename new branching. Add comments.
mbradle May 31, 2019
4637e05
Change name of priority queue template parameter. Put instantiation …
mbradle Jun 3, 2019
07f0def
Add fibonacci test temporarily for regression test.
mbradle Jun 3, 2019
777010b
Simplify test.
mbradle Jun 3, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions doc/bibliography.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -453,6 +453,36 @@ <H2>Bibliography</H2>
<em>Data Structures for Weighted Matching and Nearest Common Ancestors with Linking</em><br>
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434-443, 1990.

<P></P><DT><A NAME="camerini80">77</A>
<DD>
P. M. Camerini, L. Fratta, and F. Maffioli
<BR><em>The K Best Spanning Arborescences of a Network</em><br>
Networks 10: 91-110, 1980.

<P></P><DT><A NAME="chu-liu65">78</A>
<DD>
Y. J. Chu and T. H. Liu
<BR><em>On the Shortest Arborescence of a Directed Graph</em><br>
Science Sinica 14: 1396-1400, 1965.

<P></P><DT><A NAME="edmonds67">79</A>
<DD>
J. Edmonds
<BR><em>Optimum Branchings</em><br>
J. Res. Nat. Bur. Standards 71B: 233-240, 1967.

<P></P><DT><A NAME="tarjan77">80</A>
<DD>
R. E. Tarjan
<BR><em>Finding Optimum Branchings</em><br>
Networks 7: 25-35, 1977.

<P></P><DT><A NAME="camerini79">81</A>
<DD>
P. M. Camerini, L. Fratta, and F. Maffioli
<BR><em>A Note on Finding Optimum Branchings</em><br>
Networks 9: 309-312, 1979.

</dl>

<br>
Expand Down
Loading