Advertisement
Guest User

Untitled

a guest
Apr 23rd, 2018
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.95 KB | None | 0 0
  1. //YEEEEEEEET
  2. //LIL B BASED GOD APPROVED CODE
  3. int main(int argc, char *argv[]){
  4.  
  5. // Using command line argument for starting vertex
  6. if (argc != 2){
  7. cout << "Specify start vertex: ./kruskalTraverse [start vertex]" << endl;
  8. return 1;
  9. }
  10. int numverts; //number of vertices
  11. int weight; //weight of edges
  12. int startvert = atoi(argv[1]) - 1;
  13. int edgevalue; //isn't really important
  14. vector <int> rowvector;
  15. vector <int> colvector;
  16. cin >> weight >> numverts;
  17.  
  18. // collect input, put in rowvector and colvector
  19. for (int row = 0; row < numverts; row++){
  20. for (int col = 0; col < numverts; col++){
  21. cin >> edgevalue;
  22. if (edgevalue != 0){ //ignore the zero-edges
  23. rowvector.push_back(row);
  24. colvector.push_back(col);
  25. }
  26. }
  27. }
  28. // create graph and edges
  29. Graph g(numverts);
  30. for (int i = 0; i < 2*numverts - 2; i++){
  31. g.addEdge(rowvector[i], colvector[i]);
  32. }
  33.  
  34. cout << "Traversal (DFS):" << endl;
  35. g.DFS(startvert);
  36. cout << endl;
  37.  
  38. return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement