summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorSanto Cariotti <sancn@live.com>2017-04-27 15:32:49 +0200
committerSanto Cariotti <sancn@live.com>2017-04-27 15:32:49 +0200
commit52de06bfdb6499e3cc166fd4a9e54aa953f2fe12 (patch)
tree32f6a6b8ddc8fb589c522ea165d5cba8f6d24a83
parent0ac2603ae4c097e9c0e3915d96cc96387f186f19 (diff)
Deleted es4
-rw-r--r--cpp/es4.cpp67
1 files changed, 0 insertions, 67 deletions
diff --git a/cpp/es4.cpp b/cpp/es4.cpp
deleted file mode 100644
index a1f1716..0000000
--- a/cpp/es4.cpp
+++ /dev/null
@@ -1,67 +0,0 @@
-#include <iostream>
-#define BIANCO 0 //Non Visitato
-#define NERO 2 //Visitato
-#define GRIGIO 1 //Non Finito
-#define INF 999999
-#include <vector>
-#include <fstream>
-#include <queue>
-#define MAXN 9999
-#define INDEF -1
-#include <stack>
-using namespace std;
-typedef pair<int,int> p;
-int V,E;
-
-struct nodo {
- vector <p> adj;
- int dist;
- nodo(){
- dist=INF;
- }
-}no[MAXN];
- int colore[MAXN];
- void relax (nodo no[], int u, int z)
- {
- p v= no[u].adj[z];
- if (no[v.first].dist> no[u].dist + v.second )
- {
- no[v.first].dist= no[u].dist + v.second;
- }
- }
-
- void bf (nodo no[],int n, int s)
- {
- int i,j,z;
- no[0].dist=0;
- for (i=0;i<V;i++) //Scorro
- {
- for (j=0;j<V;j++)
- {
- for (z=0;z<no[j].adj.size();z++)
- {
- relax(no,j,z);
- }
- }
- }
-
- }
-
-
-int main(int argc, char** argv) {
- ifstream in ("input.txt");
- ofstream out ("output.txt");
- in>>V>>E;
- int a,b,c;
- for (int i=0;i<E;i++)
- {
- in>>a>>b>>c;
- no[a].adj.push_back(p(b,c));
- }
- bf(no,V,0); //Adiacenze, numeri di vertici, sorgente
- for (int i=0;i<V;i++)
- {
- cout<<no[i].dist<<endl;
- }
- return 0;
-}