| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2017-01-06 | Optimalize by using vectors over maps and sets | Marcin Chrzanowski | |
| - 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 | |||
| 2017-01-05 | Fix bug | Marcin Chrzanowski | |
| 2017-01-05 | Refactor | Marcin Chrzanowski | |
| - Reorder includes - Unify reference style - Improve whitespace | |||
| 2017-01-05 | Return vertices in a vector | Marcin Chrzanowski | |
| 2017-01-05 | Switch to unordered maps and sets | Marcin Chrzanowski | |
| 2017-01-04 | Implement concurrent Brandes's algorithm | Marcin Chrzanowski | |
| 2017-01-04 | Read edges until end of file | Marcin Chrzanowski | |
| 2017-01-04 | Note existence of out edges | Marcin Chrzanowski | |
| 2017-01-04 | Implement DependencyCalculator | Marcin Chrzanowski | |
| A DependencyCalculator instance will, for each vertex in the given graph, calculate the dependency on the given vertex. | |||
| 2017-01-04 | Store vertices in Graph | Marcin Chrzanowski | |
| 2017-01-04 | Return Graph by const reference | Marcin Chrzanowski | |
| 2017-01-03 | Parse args and input | Marcin Chrzanowski | |
| 2017-01-03 | Implement graph parser | Marcin Chrzanowski | |
| 2017-01-03 | Add get_vertices | Marcin Chrzanowski | |
| 2017-01-03 | Switch to iostream | Marcin Chrzanowski | |
| 2017-01-03 | Implement graph | Marcin Chrzanowski | |
| 2016-12-28 | Initial commit | Marcin Chrzanowski | |