First commit.
Starting to write findPath method.
Added calculations of one turn of algorithm.
Working program.
Added comments.
Fixed error when second index in function findPath is bigger then first.
Remembered about encapsulation.
Calculations of weights now are running throw threads.
Added new class implemented Runnable.
Moved code from for loop into separate thread.
Deleting unnecessary files.
Created new version of graph, based on Vector.
Rewrote calculateMinimums using thread pool. Added method filll.
Changed formatting
Add 'java/dijkstra/' from commit '14bdb5d4e136dbf0f9b59e7153fc0764a939fb51'

git-subtree-dir: java/dijkstra
git-subtree-mainline: e8635fba8585eb6979d874e04be182d90a28fb52
git-subtree-split: 14bdb5d4e136dbf0f9b59e7153fc0764a939fb51