Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //YEEEEEEEET
- //LIL B BASED GOD APPROVED CODE
- int main(int argc, char *argv[]){
- // Using command line argument for starting vertex
- if (argc != 2){
- cout << "Specify start vertex: ./kruskalTraverse [start vertex]" << endl;
- return 1;
- }
- int numverts; //number of vertices
- int weight; //weight of edges
- int startvert = atoi(argv[1]) - 1;
- int edgevalue; //isn't really important
- vector <int> rowvector;
- vector <int> colvector;
- cin >> weight >> numverts;
- // collect input, put in rowvector and colvector
- for (int row = 0; row < numverts; row++){
- for (int col = 0; col < numverts; col++){
- cin >> edgevalue;
- if (edgevalue != 0){ //ignore the zero-edges
- rowvector.push_back(row);
- colvector.push_back(col);
- }
- }
- }
- // create graph and edges
- Graph g(numverts);
- for (int i = 0; i < 2*numverts - 2; i++){
- g.addEdge(rowvector[i], colvector[i]);
- }
- cout << "Traversal (DFS):" << endl;
- g.DFS(startvert);
- cout << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement