====================

* Shortest path "trees" (SPTs) for BFS/Dijkstra. "Trees" because multiple
  shortest paths are allowed for use in centrality computations. Also traversal
  graphs for DFS. [#36]

* Edge betweenness centrality. Before betweenness centrality was only available
  for vertices. [#33]

* An AccessibilityAnalyzer which calculates, for each node in the graph, the
  closest destination (as well as the distance to this destination) from a list of
  possible destinations [#31]

* Improved performance of Dijkstra Many-To-One by using a reversed graph

* Major refactor of the data package (vertices)

Bug fixes
=========

* In Dijkstra/BFS, predecessors are not added prematurely anymore [#34]