Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public void Algo_20160128(int[] A)
- {
- var r1 = true;
- var r2 = true;
- var this_T = 0;
- var Gt_T = 0;
- var B = new int[A.Length];
- var x = 0;
- B[0] = A[0];
- for (var i = A.Length - 1; i > 0; i--)
- B[x += 1] = A[i];
- var Gt = this.Trasposto("Gt_" + Nome, false);
- this.DFS_Visita(this.get_nodo(A[0]), ref this_T);
- Gt.DFS_Visita(Gt.get_nodo(A[0]), ref Gt_T);
- for (var i = 1; i < A.Length; i++)
- {
- var nod_pre = this.get_nodo(A[i - 1]);
- var nod = this.get_nodo(A[i]);
- var s = ControllaIntervallo(nod_pre.discovered, nod_pre.finished, nod.discovered, nod.finished);
- if (s != eIntervallo.Contiene)
- r1 = false;
- }
- for (var i = 1; i < B.Length; i++)
- {
- var nod_pre = Gt.get_nodo(B[i - 1]);
- var nod = Gt.get_nodo(B[i]);
- var s = ControllaIntervallo(nod_pre.discovered, nod_pre.finished, nod.discovered, nod.finished);
- if (s != eIntervallo.Contiene)
- r2 = false;
- }
- var r = r1 || r2;
- Console.WriteLine("Per il grafo {0}, {1}esiste un percorso che passa per [{2},{3}]", Nome, (r ? "" : "non "), string.Join(",", A), A[0]);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement