nefeli g flycye
🧸
SuryaPratapK
/ Dijkstra algorithm
Created
August 13, 2020 20:51
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include<bits/stdc++.h> | |
| using namespace std; | |
| #define V 6 //No of vertices | |
| int selectMinVertex(vector<int>& value,vector<bool>& processed) | |
| { | |
| int minimum = INT_MAX; | |
| int vertex; | |
| for(int i=0;i<V;++i) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| sepal.length | sepal.width | petal.length | petal.width | variety | |
|---|---|---|---|---|---|
| 5.1 | 3.5 | 1.4 | .2 | Setosa | |
| 4.9 | 3 | 1.4 | .2 | Setosa | |
| 4.7 | 3.2 | 1.3 | .2 | Setosa | |
| 4.6 | 3.1 | 1.5 | .2 | Setosa | |
| 5 | 3.6 | 1.4 | .2 | Setosa | |
| 5.4 | 3.9 | 1.7 | .4 | Setosa | |
| 4.6 | 3.4 | 1.4 | .3 | Setosa | |
| 5 | 3.4 | 1.5 | .2 | Setosa | |
| 4.4 | 2.9 | 1.4 | .2 | Setosa |