public static int[] Get_Next_Markers(int[][] adjancy_list, int[] markers, Mark_Int_List G2) { int[] current_markers = markers; for (int i1 = 0; i1 < adjancy_list.Length; i1++) { if (All_Diferent(current_markers)) { return(current_markers); } G2.Clear(); int[] next_preliminary_markers = Get_New_Marker_For_Each_NodeV2(G2, adjancy_list, current_markers); int[] next_secondary_markers = Replace_Markers_With_Indexes(G2.Get_All_Marker_Maping().ToArray(), next_preliminary_markers); if (current_markers.SequenceEqual(next_secondary_markers)) { return(current_markers); } current_markers = next_secondary_markers; } return(current_markers); }
public void Clear() { mrk_int_list.Clear(); }
public static bool Graph_Isomorphism(int[][] adjancy_matrix_A, int[][] adjancy_matrinx_B) { if (adjancy_matrix_A.Length != adjancy_matrinx_B.Length) { return(false); } int[] next_markers_A; int[] current_markers_A = Get_Primary_Markers(adjancy_matrix_A); int[] next_markers_B; int[] current_markers_B = Get_Primary_Markers(adjancy_matrinx_B); int[] p1; int[] p2; Mark_Int_List G2 = new Mark_Int_List(); int i2; int r1, r2; bool should_break = true; for (r1 = 0; r1 < current_markers_A.Length; r1++) { for (r2 = 0; r2 < current_markers_A.Length; r2++) { p1 = current_markers_A.ToArray(); p2 = current_markers_B.ToArray(); Array.Sort(p1); Array.Sort(p2); if (!p1.SequenceEqual(p2)) { return(false); } should_break = true; for (i2 = 1; i2 < p1.Length; i2++) { if (p1[i2] == p1[i2 - 1]) { should_break = false; break; } } if (should_break) { break; } should_break = true; for (i2 = 1; i2 < p1.Length; i2++) { if (p2[i2] == p2[i2 - 1]) { should_break = false; break; } } if (should_break) { break; } G2.Clear(); next_markers_A = Get_New_Marker_For_Each_NodeV2(G2, adjancy_matrix_A, current_markers_A); next_markers_B = Get_New_Marker_For_Each_NodeV2(G2, adjancy_matrinx_B, current_markers_B); next_markers_A = Replace_Markers_With_Indexes(G2.Get_All_Marker_Maping().ToArray(), next_markers_A); next_markers_B = Replace_Markers_With_Indexes(G2.Get_All_Marker_Maping().ToArray(), next_markers_B); if (current_markers_A.SequenceEqual(next_markers_A)) { break; } if (current_markers_B.SequenceEqual(next_markers_B)) { break; } current_markers_A = next_markers_A; current_markers_B = next_markers_B; } if (should_break) { break; } int lowest_duplicate = Find_Lowest_Duplicate(current_markers_A); Change_Marker(lowest_duplicate, current_markers_A); Change_Marker(lowest_duplicate, current_markers_B); } bool[,] k1 = Rearange_Matrix_According_To_Markers(To_Adjancy_Matrix_From_Adjency_Lists(adjancy_matrix_A), current_markers_A); bool[,] k2 = Rearange_Matrix_According_To_Markers(To_Adjancy_Matrix_From_Adjency_Lists(adjancy_matrinx_B), current_markers_B); return(Are_Identical_Matrixes(k1, k2)); }