SHARE
TWEET

Untitled

a guest May 25th, 2019 73 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. void BFS(element *vertices, int max_chrome, int max_valency)
  2. {
  3.     element *subgraph = new element;
  4.     subgraph->next = vertices->next;
  5.     delete_element(vertices,vertices->next->number);
  6.  
  7.     while (subgraph)
  8.     {
  9.         while (vertices)
  10.         {
  11.             vertices = vertices->next;
  12.             if (subgraph->next->data[vertices->number] == '1')
  13.             {
  14.                 add_element(subgraph, vertices);
  15.                 delete_element(vertices,vertices->number);
  16.             }
  17.         }
  18.         subgraph = subgraph->next;
  19.     }
  20.  
  21.  
  22. }
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
 
Top