for (j = i + 1; j < path->childs->size; ) {
sp1 = path->childs->data[j];
+ if (sp0->parent_p1 <= sp1->parent_p0 || sp0->parent_p0 >= sp1->parent_p1) {
+ j++;
+ continue;
+ }
+
if (sp0->parent_p0 <= sp1->parent_p0 && sp0->parent_p1 >= sp1->parent_p1) {
j++;
continue;
int ret = _topo_paths(f, el, ctx->paths);
if (ret < 0)
return ret;
-
+#if 1
ret = _topo_path_completes(f, ctx->paths);
if (ret < 0)
return ret;
-
+#endif
for (i = 0; i < ctx->paths->size; i++) {
path = ctx->paths->data[i];
return ret;
int j;
- for (j = 0; j < 1; j++) {
+ for (j = 0; j < 3; j++) {
printf("\n\033[33m%s(), %d(), j: %d\033[0m\n", __func__, __LINE__, j);
ret = __ses_steps_analyse(f, ns, i, ctx);