26/03/13 17:57
Alberto19890
Buona sera ragazzi, come state ? è passato un po' di tempo, ma per fortuna ho imparato a creare un grafo aggiungendo nodi e archi, segnando quale sia il vertice successivo ed il relativo peso.
Adesso, visto che la consegna della tesi è tra due settimane, chi mi potrebbe dare una dritta su questa seconda parte del programma?
The algorithm repeats all the following steps until no vertices are present in the unsatisfied list:
1) Remove some vertex v from the unsatisfied list
2) Examine edges entering v. If two edges with the form (u,v) are found, apply a parallel reduction to them. Continue examining edges entering v and applying parallel reductions until either (i) only one edge leaves v or (ii) v is found to have two distinct predecessors
3) Examine edges leaving v. If two edges sith the form (v,w) are found, apply a parallel reduction to them. Continue examining edges leaving v and applying parallel reduction until either (i) only one edge leaves v or (ii) v is found to have two distinct successors
4) If only one edge (u,v) now enters v and only one edge (v,w) leaves v, carry out the following steps:
a. Apply a series reduction to delete v and replace (u,v) and (v,w) by a new edge (u,w)
b. If u is not the source and not on the unsatisfied list, add it to the unsatisfied list
c. If w is not the sink and not on the unsatisfied list, add it to the unsatisfied list
When the unsatisfied list is empty, we test whether any vertices other than the source and the sink remain. It so, the multidigraph is not reducible to a single edge. If not, we complete the reduction to a single edge by applying parallel reduction to the edges joining the source and sink.
io vorrei creare la lista con dentro i miei vertici (cosa che ho già fatto), ma le operazioni segnate non riesco a trovare proprio il modo di farlo
chi mi darebbe una mano per favore??
Adesso, visto che la consegna della tesi è tra due settimane, chi mi potrebbe dare una dritta su questa seconda parte del programma?
The algorithm repeats all the following steps until no vertices are present in the unsatisfied list:
1) Remove some vertex v from the unsatisfied list
2) Examine edges entering v. If two edges with the form (u,v) are found, apply a parallel reduction to them. Continue examining edges entering v and applying parallel reductions until either (i) only one edge leaves v or (ii) v is found to have two distinct predecessors
3) Examine edges leaving v. If two edges sith the form (v,w) are found, apply a parallel reduction to them. Continue examining edges leaving v and applying parallel reduction until either (i) only one edge leaves v or (ii) v is found to have two distinct successors
4) If only one edge (u,v) now enters v and only one edge (v,w) leaves v, carry out the following steps:
a. Apply a series reduction to delete v and replace (u,v) and (v,w) by a new edge (u,w)
b. If u is not the source and not on the unsatisfied list, add it to the unsatisfied list
c. If w is not the sink and not on the unsatisfied list, add it to the unsatisfied list
When the unsatisfied list is empty, we test whether any vertices other than the source and the sink remain. It so, the multidigraph is not reducible to a single edge. If not, we complete the reduction to a single edge by applying parallel reduction to the edges joining the source and sink.
io vorrei creare la lista con dentro i miei vertici (cosa che ho già fatto), ma le operazioni segnate non riesco a trovare proprio il modo di farlo
chi mi darebbe una mano per favore??
aaa