-
Notifications
You must be signed in to change notification settings - Fork 0
/
chk_consist.c
59 lines (50 loc) · 1.48 KB
/
chk_consist.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/**
>HEADER
Copyright (c) 2004 Haixu Tang [email protected]
This file is part of the RepGraph package.
RepGraph is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
RepGraph is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with RepGraph. If not, see <http://www.gnu.org/licenses/>.
<HEADER
**/
#include <stdinc.h>
#include <extvab.h>
#include <extfunc.h>
int chk_consist(PATH *startpath, PATH *midpath, int num_midpath, int *n);
int chk_consist(PATH *startpath, PATH *midpath, int num_midpath, int *n)
{
int i, j, k, l, c;
c = -1;
for(i = 0; i < num_midpath; i ++) {
if(startpath -> len_path <= midpath[i].len_path) {
for(j = 0; j < startpath -> len_path; j ++) {
if(startpath -> edge[j] != midpath[i].edge[j]) {
break;
}
}
if(j == startpath -> len_path) {
c = 0;
*n = i;
break;
}
} else {
for(j = 0; j < midpath[i].len_path; j ++) {
if(startpath -> edge[j] != midpath[i].edge[j]) {
break;
}
}
if(j == midpath[i].len_path) {
c = i + 1;
break;
}
}
}
return(c);
}