1 /*
2 * vim: ts=4 sw=4 et tw=0 wm=0
3 *
4 * libavoid - Fast, Incremental, Object-avoiding Line Router
5 * Copyright (C) 2004-2005 Michael Wybrow <mjwybrow@users.sourceforge.net>
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 */
23 #include <cassert>
24 #include "libavoid/connector.h"
25 #include "libavoid/visibility.h"
27 namespace Avoid {
30 // This should only be used for the static algorithm.
31 //
32 // XXX: If to set up the vis graph for incremental it would need
33 // the shapeRef ppinters in obs.
34 //
35 void CreateVisGraph(Polygn **obs, int n_obs)
36 {
37 for (int poly_i = 0; poly_i < n_obs; poly_i++)
38 {
39 unsigned int id = obs[poly_i]->id;
41 new ShapeRef(id, *(obs[poly_i]));
42 }
43 computeCompleteVis();
44 }
47 void DestroyVisGraph(void)
48 {
49 ShapeRefList::iterator sFinish = shapeRefs.end();
50 ShapeRefList::iterator sCurr;
52 while ((sCurr = shapeRefs.begin()) != sFinish)
53 {
54 ShapeRef *shape = (*sCurr);
56 shape->removeFromGraph();
57 delete shape;
58 }
60 ConnRefList::iterator cFinish = connRefs.end();
61 ConnRefList::iterator cCurr;
63 while ((cCurr = connRefs.begin())!= cFinish)
64 {
65 ConnRef *conn = (*cCurr);
67 conn->removeFromGraph();
68 conn->unInitialise();
69 }
71 assert(vertices.connsBegin() == NULL);
72 }
75 }