Use your computer fearlessly.

## Graph Isomorphism
Given two graphs, determine if they are topologically equivalent. Topological equivalence is found by identifying a bijection from the nodes of one graph to the nodes of the other such that the edges also have a bijection. If the two graphs are equivalent, then there is a way to draw the two graph such that they look identical, even if the node labels are different on the two graphs.
This code is implemented with a proprietary software license. The code may be licensed in per user, in bulk, or per site. Please contact
To appear.
bbkirk@intrepidnetcomputing.com |