Update README.md

Author: vittorioPiotti

README.md

@@ -27,45 +27,6 @@ Pseudocodifica in C dell'algoritmo di Dijkstra con Esercizio di Default e Calcol
 <img width="300" src="https://github.com/vittorioPiotti/Algoritmo-Dijkstra-C/blob/main/snap.png"/>
 
 
-## Snippet Dijkstra Algorithm
-
-```c
-
-int dijkstra(struct ConnectedNodes connectedNodes[], struct Paths paths[], struct RoutingTables routingTables[],int start, int end,int nNodes){
-    int i = 0;
-    int j = 0;
-    int inx = 0;
-    int cost = 0;
-    int nPaths = 1;
-    for(i = 0; i < nNodes; i ++){
-        if(routingTables[0].routingTable[i].id == start)routingTables[0].routingTable[i].cost = 0;
-    }
-    do{
-        i = getInxMinCostNotExplored(routingTables[0].routingTable,nNodes);
-        routingTables[0].routingTable[i].used = USED;
-        if(routingTables[0].routingTable[i].cost == MAX_COST + 1)cost = 0;
-        else cost = routingTables[0].routingTable[i].cost;
-        if(connectedNodes[i].length != 0){
-            for(j = 0; j < connectedNodes[i].length; j ++){
-                inx = getInxRoutingTable(routingTables[0].routingTable,connectedNodes[i].connections[j].id,nNodes );
-                if(connectedNodes[i].connections[j].cost + cost < routingTables[0].routingTable[inx].cost){
-                    routingTables[0].routingTable[inx].cost = connectedNodes[i].connections[j].cost + cost;
-                    routingTables[0].routingTable[inx].prec = connectedNodes[i].id;
-                }else if(connectedNodes[i].connections[j].cost + cost == routingTables[0].routingTable[inx].cost){
-                    routingTables[nPaths].routingTable[inx].cost = connectedNodes[i].connections[j].cost + cost;
-                    routingTables[nPaths].routingTable[inx].prec = connectedNodes[i].id;
-                    nPaths++;
-                }
-            }
-        }
-    }while(allExplored(routingTables[0].routingTable,nNodes) == NOT_USED);
-    if(nPaths > 1)fixRoutingTable(routingTables, nPaths, nNodes);
-    initPaths(routingTables, paths, nPaths, nNodes, start, end);
-    fixResults(routingTables, paths, nPaths, nNodes);
-    return nPaths;
-}
-
-```
 
 ## Licenze