public void buildGraph()
    {
        StatWriter writer = null;
        try {
            writer = new StatWriter(new File("stats.txt"), true);
        }   catch (Throwable e) {}

        LinkedList<Vertex> vlist = vertices.toLinkedList();
        while (vlist.hasNext())
            vlist.getNext().removeAllAdjacents();
        vlist.reset();
        while (vlist.hasNext())
        {
            Vertex v = vlist.getNext();
            if (!v.isVertex())  continue;
            LinkedList<Vertex> graphList =
                AngleElimination.findUnobstructedPoints(v, vertices.toLinkedList(), writer);
            while (graphList.hasNext())
                v.addAdjacent(graphList.getNext());
        }

        try {
            writer.close();
        }   catch (Throwable e) {}
    }