# Detecting Isomorphism of graphs with fixed edge...?positions?

I updated my Question in the comments below. The problem is described below and in the code playground. https://code.sololearn.com/cJvn8noA4Viy By using pentagon shaped tiles, shapes can be created, and I am looking on how to recognize specific shapes or match to preexisting shapes. I am looking for anyone who can direct me to towards how to come up with an existing class I am unaware of or tutorial on how to determine isomorphism with Location Specific Edges. I feel it would be an advanced use of an adjacency list or matrix. //Current Problem 6/23/18 /* ^ / \ \_/ 0 / | \ _ _ / _ \ _ 4 / \1 / \ / \ / \ \ / \ / \ / \ / 3 V 2 V V V The left example is a vertex with specific edge locations[0-4] The right example is not a tree, but an undirected graph. The vertex is to represesnt a pentagon, and the graph is to represent a collection of vertices. By placing several tiles toether you can create shapes, the image to the right is to represent a graph I have called 'Sprout'. If I have a graph, independent of the vertex data but dependent on specific edges connected, I would like to compare it to another graph in the form of an isomorphism detection algorithm caring only about the edge location data. I have several shapes I am looking for, and can construct them with the code below, but I do not know how to compare one graph to another. I am looking for a method in the graph class that looks like this... public bool isSimilarTo(VertGraph otherGraph){ [[Code Stuff]]; return true/false;} */