Skip to content

Dev3#132

Closed
anadon wants to merge 3 commits intoboostorg:developfrom
mbradle:dev3
Closed

Dev3#132
anadon wants to merge 3 commits intoboostorg:developfrom
mbradle:dev3

Conversation

@anadon
Copy link
Copy Markdown
Contributor

@anadon anadon commented Nov 6, 2018

I'm going through other forks and came across this. I think it is worth a look.

…he messages below:

Add proposed new files.

Use std::less for default comparison.  Use std::greater in example.  (Sat Aug 29 17:18:27 2015 -0400)

Allow for other vertex list type than vecS.  Change test code to use setS for vertices. (Wed Sep 2 18:10:41 2015 -0400)

Move rank routine to implementation. (Fri Sep 4 18:56:40 2015 -0400)

Remove unnecessary template parameters--already defined as global types. (Mon Sep 7 08:32:53 2015 -0400)

Move BranchingGraph and BranchingVertex into detail namespace. (Thu Sep 10 13:27:29 2015 -0400)

Change to have functor iterate on edges. (Mon Sep 28 16:09:20 2015 -0400)

Fix template typename issues. (Mon Sep 28 16:35:14 2015 -0400)

Rename files.  Generalize input of graph in rank-branchings2.cpp. (Wed Sep 30 17:45:04 2015 -0400)

Do some clean up. (Fri Oct 2 09:59:43 2015 -0400)

Simplify number of branchings to compute by computing it through the called functor. (Mon Oct 5 13:54:32 2015 -0400)

Update test routines. (Mon Oct 5 14:50:48 2015 -0400)

Use iterators on edges. (Thu Oct 8 07:45:25 2015 -0400)

Add return value. (Thu Oct 8 13:51:29 2015 -0400)

Use pair for edge iterators in user-supplied functor. (Sat Oct 10 09:29:19 2015 -0400)

Use named parameters. (Sun Nov 15 10:00:42 2015 -0500)

Use distance_compare since this compares both edge and branching weights.  Restore named_functions.  Use named parameters in test_real_ranking (for testing). (Sun Nov 15 13:40:44 2015 -0500)

Explicitly call named parameters to test.  Add removal for Cygwin in test.  Move test for empty graph. (Mon Nov 16 07:49:44 2015 -0500)

Add documentation.  Alphabetize includes. (Mon Nov 16 17:00:42 2015 -0500)

Update. (Wed Nov 18 18:37:29 2015 -0500)

Update documentation and add references. (Sun Nov 22 10:26:58 2015 -0500)

Remove unnecessary concept checks.  Update documentation. (Sun Nov 22 12:40:32 2015 -0500)

Update documentation. (Mon Nov 23 08:18:57 2015 -0500)

Update references.  Add example usage statement. (Tue Nov 24 07:50:30 2015 -0500)

Add sentence on weight modification. (Thu Nov 26 08:05:46 2015 -0500)

Simplify removal of parallel arcs. (Fri Dec 11 15:05:50 2015 -0500)

Concept check that edge weight is less than comparable only if edge comparison function is not supplied (to allow, for example, complex edge weights if user supplies the appropriate comparison function). (Sun Feb 28 11:26:30 2016 -0500)

Do some clean up. (Tue Mar 1 18:53:57 2016 -0500)

Update jam file.  Move tests to single code. (Fri Apr 8 15:12:34 2016 -0400)

Add test of graphs with complex weight. (Sat Apr 9 09:47:51 2016 -0400)

Remove unused typedef Vertex and place check on typedef Edge. (Wed Apr 20 16:11:14 2016 -0400)

Simplify initialization. (Mon Aug 8 10:09:40 2016 -0400)

Change to use filtered graph for branching processor.  Explicitly add branching edge to in edges in condensed vertex in next to correct problem when there are many in edges with the same weight such that the branching edge might be skipped. (Thu Sep 29 17:48:39 2016 -0400)

Add examples to Jamfile.  Use scoped pointer for summing branching weights to allow general weight type.  Add class weight to test. (Tue Oct 4 17:07:43 2016 -0400)

Remove extraneous comment. (Sat Nov 5 10:41:54 2016 -0400)
@anadon
Copy link
Copy Markdown
Contributor Author

anadon commented Nov 6, 2018

Didn't see #82 when looking at this,

@anadon anadon closed this Nov 6, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants