title: Implementing graphs using array
body: <p>I would like to implement a tool that generates graphs whose memory will be allocated on a data structure so called "Tape". You can think of a Tape as an array of elements, each of which holds "Node ID", links to its "Parent Node" as well as its "Child Nodes".</p>
  
  <p>What I am looking for is an approach in which identifying available slots in the array is cheap so that when a new node is to be added, an empty slot can be quickly identified.</p>
  
  <p>And what if I implemented the Tape using a dynamic array? In the situation where the size of the array needs resizing, can I avoid copying the entire Tape over to a newly allocated array?</p>
  
  <p>Anyone here has any idea ?</p>