Graph Analyzer 1.3

Graph analyzer is an indispensable assistant for solving problems using graphs. The program provides an opportunity not only to create and process graphs, but also to visually display the results of algorithms. Supports work with oriented and simple graphs, loaded and unloaded, 17 algorithms for working with a graph.

The program implements a variety of algorithms for processing graphs: path search, minimum path search in 3 different ways, Eulerian and Hamiltonian routes search, chromatic number determination, minimum residual tree search, maximum flow determination for both one drain and source, and for multiple drains and sources, connectivity check, eccentricity search, radius search and the diameter of the graph, checking whether the graph is a tree, checking for planarity.