I upload four new files. One of them is the dijkstra algorithm, what can
find the sortest path from a start node to the all other nodes. An other
of them is the fibonacci heap module, what I completed with a search
method, which can find an entry from it's value. The two other is the
node and edge classes. Both of them only have a few variable and get/set
methods.