Skip to content

PopovIvan1/Graph_Isomorphism

Repository files navigation

The problem is posed of checking two graphs for isomorphism. The input of the algorithm are two adjacency matrices. At the output, the algorithm displays information about the isomorphism. The algorithm also calculates the time it took to solve the problem. The code implements the MVC-pattern.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages