title: Edge addition complexity in planar graph?
body: <p>I created a program that adds edges between vertices. The goal is to add as many edges as possible without crossing them(ie Planar graph). What is the complexity?</p>
  
  <p>Attempt: Since I used depth first search I think it is O(n+m) where n is node and m is edge.</p>
  
  <p>Also, if we plot the number of edges as a function of n what is it going to look like?</p>
  
  <p>(* I'm re posting the question since noone answered it the last time *)</p>