Algorithms on undirected and directed graphs Dividers : Simple undirected graph; Mars : Bipartite graph; MaxComponent : Max connected component of a graph; BridgeNum : Number of bridges between components of an undirected graph; EqDist : Vertecies equaly distanced from each other; Kruskal : Kruskal's algorithm; Prim : Prim's algorhytm; GraphBase : Base of the directed graph; MapRoute : Shortest path on the map; Modules : Parser and Tarjan algorithm;