writing a code for chess board (8x8), except the verteces are nodes, and edges are connection between nodes.. i.e, 8x8 network
<p>I am trying to write a code for just the chess board (8x8), where each vertex is a node, and edges are connections between the nodes.  Each node is connected with either 2, 3 or 4 nodes. </p>

<p>I am trying to write the code considering a node as an object. I am new to Graph theory implementation. Please help me out.</p>

<p><a href="http://postimage.org/image/720da4cw1/" rel="nofollow">http://postimage.org/image/720da4cw1/</a>      I should me more clear earlier. Each circle represents a node. A square has nothing to do. Every node is connected to its adjacent nodes. </p>
