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.
-
Notifications
You must be signed in to change notification settings - Fork 0
PopovIvan1/Graph_Isomorphism
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published