public void removeEdge(int start, int end)
    {
        if (start < 0 || start >= myNumVertices || end < 0 || end >= myNumVertices) {
            throw new IllegalArgumentException(
                "Illegal vertex for this graph, must be between 0 and " + myEdges.length
                                + ".  Start: " + start + " End: " + end);
        }
        Iterator<Edge> itr = myEdges[start].iterator();
        while (itr.hasNext()) {
            if (itr.next().getTarget() == end) {
                itr.remove();
                return;
            }
        }
    }