Version 0.1.2

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

Add edge ids. This will be important especially when calculating edge
betweenness centrality.

New in version 0.1.1

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

* 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]

Version 0.1

===========

The graph to be analyzed may be (un)directed / (un)weighted. It is also easy to
reverse edge orientation.

* Algorithms:
    - Dijkstra's Algorithm
        : One-To-One
        : One-To-Many
        : Many-To-One
        : Many-To-Many
    - Breadth First Search (BFS)
    - Depth First Search (DFS)

* Augmented Dijkstra (for weighted graphs) and BFS (for unweighted graphs)
  algorithms are used to compute betweenness and closeness centrality for
  vertices using Brande's algorithm.

* An augmented DFS algorithm is used to compute Strahler stream order (for
  mathematical trees)