brandes/src, branch master

Refactor

2017-01-06T21:55:23+00:00

- Remove unnecessary include
- Improve whitespace
- Remove unnecessary variable declaration
- Move function call to more logical place

Optimalize by using vectors over maps and sets

2017-01-06T20:57:28+00:00

- Can iterate over vertices with for (int v = 0; v < number_vertices;
v++) loop
- This required internally remapping the vertices from their actual
names to 0, 1, ..., number_vertices - 1.
- Use Graph::get_real_vertex(vertex) to get original value

Fix bug

2017-01-05T18:49:33+00:00

Refactor

2017-01-05T18:38:51+00:00

- Reorder includes
- Unify reference style
- Improve whitespace

Return vertices in a vector

2017-01-05T17:49:54+00:00

Switch to unordered maps and sets

2017-01-05T16:52:19+00:00

Implement concurrent Brandes's algorithm

2017-01-05T04:09:53+00:00

Read edges until end of file

2017-01-05T04:09:14+00:00

Note existence of out edges

2017-01-05T04:08:45+00:00

Implement DependencyCalculator

2017-01-04T20:20:48+00:00

A DependencyCalculator instance will, for each vertex in the given
graph, calculate the dependency on the given vertex.