Changed sequentialSearch to binarySearch in B-tree implementation, because sequential search resulted in bad performance when comparison operation of element type takes long time (which is true in many cases).
Got rid of Alphabet template class to simplify abstract_string.
Added get_shortest_path method for getting shortest path using Dijkstra algorithm.
Revised path class to adjust index of verteces. Source vertex is 0 now.