Finding adjacent nodes
<p>I have a series of polygons, represented in 3 vector3 objects. ie: </p>

<pre><code>{
  "a": [1,2],
  "b": [3,4],
  "c": [5,6]
}
</code></pre>

<p>Where <code>a,b,c</code> are the three points of a triangle, and the index's <code>0,1</code> are <code>x,y</code> respectively. </p>

<p>If this object was in an array, with 50 or so other triangles, each having a shared vertex, what algorithm per se could I potentially run to create some sort of array of indexes of sibling triangles?</p>