title: A graph with n nodes and n vertices can contain just one cycle
body: <p>If a graph unweighted <code>G</code> have the same number of <code>Nodes</code> and <code>Edges</code> , it is correct to assume that the graph <code>G</code> just contain one cycle ? Can be proved ?</p>
  
  <p>EDIT: And all node are conected</p>