Tags

First working version

The program is able to:

* define a weighted graph, directed or undirected,
* export such a graph as a TikZ image,
* perform the Dijkstra's algorithm on this graph for a given starting
  vertex,
* export the steps of the Dijkstra's algorithm in a form of a LaTeX
  table,
* export the shortest path tree (shortest path covering).