title: Any working example of VF2 algorithm?
body: <p>I have been reading the <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.101.5342&amp;rep=rep1&amp;type=pdf">VF2 algorithm</a> for finding if two graphs are isomorphic but am somehow missing the big picture. Could be that I am missing the relevant background in this area but all I see is a bunch of rules that I need to use at each step, without seeing an intuitive explanation for why the steps are being carried out. </p>
  
  <p>From basic Googling, it appears that this is considered one of the de facto algorithms for finding if two graphs are isomorphic but for some reason I am unable to find an explanation that is simple enough to understand at a high level. Or is this algorithm known by a different name?</p>
  
  <p>In any case, is anyone aware of any running examples of how this algorithm works? </p>