The application window on the left shows images of the cube using various aesthetic criteria in forming the visual representation. On the right is an image of the M28 lattice
Tatt's graph. There is no Hamiltonian cycle in the graph
The result of heuristic graph coloring algorithm with chromatic number equal to 4
The minimal coloring for a graph without triangles G4 with chromatic number equal to 4. The graph is constructed in the process of proving by induction the theorem on existence of graphs without triangles with arbitrarily large chromatic number (Zykov A.A.).
The result of the calculation of the characteristics of the project network. In the result window the description of the work and event parameters, In the application window the Gantt chart for the project will be presented. The procedure can be executed only for oriented networks without loops with one source and one sink. The weight of the arc is the runtime of the work. If there is an arc decomposition (the work is represented on the lower level as an independent project), the algorithm will recursively determine the length of the critical path in the decomposition and pass this value to the upper level as the arc length.
Construction of a dominance hierarchy in a social network (algorithm described by Linton Freeman). The vertices are colored in three colors according to their closeness to the top or the bottom of the hierarchy. Vertexes near the top of the hierarchy are colored green by default, respectively those near the bottom of the hierarchy are colored red. The proximity to the bottom and top is determined as a percentage of the whole range of ranks. The middle part of the vertex hierarchy is colored gray by default. The results window displays the original hierarchy, which is determined only by the vertex environment. Then the algorithm recurrently recalculates the ranks values, taking into account the ranks of vertices changed at the previous step.
As a result of the calculation of the centrality parameters for the social network, the vertices are colored according to their closeness to the center (green) and the outskirts (red). The results window displays the parameters calculated for each vertex and the average values
GRIN software (GRaph INterface) in MS DOS environment (1994 version)
Calculation of automorphism group in GRIN software (GRaph INterface) for MS DOS
GRIN software (GRaph INterface) help system for MS DOS
