Been delaying implementation because technically it adds nothing with
current dataset.

However, decided that my result data technically wouldn't be correct
without this section implemented. With current data, nodes should
never fail matching from this part of algorithm.

Includes two edge checking modes:
    'strict' requires 66% or more of matching edges.
    'loose' only requires 33% or more of matching edges.

Unfortunately, due to way dataset is created, edges are gauranteed to
be a match if present.

And associated code to make create image.

Includes visual representation.

Still a few glaring issues. But at least current progress is saved.