Did I find the right examples for you? yes no

All Samples(9)  |  Call(7)  |  Derive(0)  |  Import(2)

src/n/i/nipy-0.3.0/nipy/algorithms/graph/graph.py   nipy(Download)
        implementation is not optimal
        """
        from bipartite_graph import cross_knn
        # checks
        if seeds.shape[0] != self.V:

src/n/i/nipy-0.3.0/nipy/algorithms/graph/tests/test_bipartite_graph.py   nipy(Download)
from unittest import TestCase
 
from ..bipartite_graph import (BipartiteGraph, cross_knn, cross_eps, 
                               check_feature_matrices)
 
def test_cross_knn_1():
    """ test the construction of k-nn bipartite graph
    """
    x = basicdata()
    G = cross_knn(x, x, 2)
def test_cross_knn_2():
    """ test the construction of k-nn bipartite graph
    """
    x = basicdata()
    G = cross_knn(x, x, 1)
def test_copy():
    """ test that the weighted graph copy is OK
    """
    x = basicdata()
    G = cross_knn(x, x, 2)
def test_subraph_left():
    """ Extraction of the 'left subgraph'
    """
    x = basicdata()
    g = cross_knn(x, x, 2)