for (e0 = e; e0; e0 = ED_to_virt(e0)) {
ED_path(e0) =
getPath(e0, vconfig, 0, objl->obs, objl->cnt);
- makeSpline(g, e0, objl->obs, objl->cnt, FALSE);
+ makeSpline(e0, objl->obs, objl->cnt, FALSE);
}
resetObjlist(objl);
}
extern void jitter_d(Agnode_t *, int, int);
extern Ppoly_t *makeObstacle(node_t * n, expand_t*, boolean );
extern void makeSelfArcs(edge_t * e, int stepx);
- extern void makeSpline(graph_t*, edge_t *, Ppoly_t **, int, boolean);
+ extern void makeSpline(edge_t *, Ppoly_t **, int, boolean);
extern void make_spring(graph_t *, Agnode_t *, Agnode_t *, double);
extern void move_node(graph_t *, int, Agnode_t *);
extern int init_nop(graph_t * g, int);
* is on or inside one of the obstacles and, if so, tells the shortest path
* computation to ignore them.
*/
-void makeSpline(graph_t* g, edge_t * e, Ppoly_t ** obs, int npoly, boolean chkPts)
+void makeSpline(edge_t * e, Ppoly_t ** obs, int npoly, boolean chkPts)
{
Ppolyline_t line, spline;
Pvector_t slopes[2];
e0 = e;
for (i = 0; i < cnt; i++) {
if (edgetype == EDGETYPE_SPLINE)
- makeSpline(g, e0, obs, npoly, TRUE);
+ makeSpline(e0, obs, npoly, TRUE);
else
makePolyline(e0);
e0 = ED_to_virt(e0);