Undirected Graph

Application implements some simple algorithms for nonoriented graphs, e. g. search of shortest way, search of graph frame, search of bridges and cutpoints and so on. Frame search in width. Frame search in depth. Shortest way search. Connected components count. Graph bridges. Graph cutpoints. Program interface is accessible in two languages: english and russian.