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();
i++;
}
jvo["costs"][j] = path.back().cc();
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["path"][i][0] = n->x();
jvo["path"][i][1] = n->y();
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();
i++;
}
jvo["costs"][j] = this->_path.back()->cc();
else:
plt.plot(p[0] - MINX, p[1] - MINY, color="blue", marker=".")
else:
- plt.plot(p[0] - MINX, p[1] - MINY, color="blue", marker="+")
+ if len(p) > 5 and p[5]: # parent is cusp
+ plt.plot(p[0] - MINX, p[1] - MINY, color="blue", marker="o")
+ else:
+ plt.plot(p[0] - MINX, p[1] - MINY, color="blue", marker="+")
#plt.plot(*plot_car(p), color="blue")
pass
#cc = plot_car_corners(p)