Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void primOmegaMejor(Grafo g)
- {
- int n = g.size();
- vector<int> vecino;
- vecino.push_back(0);
- vector<float> pVecino;
- int c = 0, filaMin;
- float min, act;
- while(((int)vecino.size()) !=n)
- {
- min = FLT_MAX;
- for(int f = 1; f < n; f++)
- {
- if (find(vecino.begin(), vecino.end(), f) == vecino.end())
- {
- act = g(c,f);
- if(act < min)
- {
- min = act;
- filaMin = f;
- }
- }
- }
- vecino.push_back(filaMin);
- pVecino.push_back(min);
- c = filaMin;
- }
- for(int i = 0; i < n;i++)
- {
- cout << vecino.at(i) << " > ";
- }
- cout << endl;
- for(int i = 0; i < n-1;i++)
- {
- cout << pVecino.at(i) << " > ";
- }
- cout << endl << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement