jvo["paths"][j][i][2] = n.h();
jvo["paths"][j][i][3] = n.sp();
jvo["paths"][j][i][4] = n.st();
- jvo["paths"][j][i][5] = n.p_is_cusp();
+ jvo["paths"][j][i][5] = false;
+ if (n.p_is_cusp()) {
+ assert(i > 0);
+ jvo["paths"][j][i - 1][5] = true;
+ }
i++;
}
jvo["costs"][j] = path.back().cc();
jvo["path"][i][2] = n->h();
jvo["path"][i][3] = n->sp();
jvo["path"][i][4] = n->st();
- jvo["path"][i][5] = n->p_is_cusp();
+ jvo["path"][i][5] = false;
+ if (n->p_is_cusp()) {
+ assert(i > 0);
+ jvo["path"][i - 1][5] = true;
+ }
i++;
}
jvo["costs"][j] = this->_path.back()->cc();