public  void connectGraph(){
        
        int n = _graph.getVertexCount();
        
        System.out.println("n = " + n );
        
        System.out.println("Calculating Euclidean Distance");
        
        Collection<BCNode> nodes = _graph.getVertices();
        Iterator<BCNode> iti = nodes.iterator();
        while( iti.hasNext() ) {
            BCNode nodei = iti.next();
            Iterator<BCNode> itj = nodes.iterator();
            while( itj.hasNext() ) {
                BCNode nodej = itj.next();
                if( _graph.findEdge(nodei,nodej) == null && nodei != nodej ) {
                    BCEdge e = new BCEdge( nodei.calcEucDistance( nodej ));
                    _graph.addEdge(e,nodei,nodej);
                }
            }
        }
    }