David Gleich
David Gleich
This looks to me like the C++ library wasn't installed correctly because it's failing when gettin the function pointer. Make sure you compile it (bin/createGraphLibFile.sh) and then install. I verified...
Here are some of the codes I'm using to do this now. ``` def ourncp(N, rholist=[1e-2,1e-3,1e-4]): return lgc.NCPData(lgc.GraphLocal().from_networkx(N)).approxPageRank( rholist=rholist,deep=False, neighborhoods=False,localmins=False, nthreads=64, timeout=30) def ncp_min_feature_by_group_binned(df, feature, group, edges=None, nbins=50, log=False): xs...
There is some additional stuff in the above, but it has the things you need :)
And in 3d ``` # From https://www.idtools.com.au/3d-network-graphs-python-mplot3d-toolkit/ from mpl_toolkits.mplot3d import Axes3D def draw3d(G, pos, **kwargs): fig = plt.figure() ax = fig.add_subplot(111, projection='3d') xs = [p[0] for v,p in pos.items()] ys...
We should also add the iteration that CRD discovers a node as this can be helpful information to visualize the "diffusion" of the results and pick out smaller clusters inside...
Just drop direction is the easiest... If you want to prefer something with direction you need to articulate what that is… see local higher order graph clustering for some examples...
We don't have the library working for Windows right now. On Wed, Dec 15, 2021 at 2:21 AM gejinhuan ***@***.***> wrote: > [image: image] > > the developping environment is...
So the simplest thing might be to setup Shapefile.jl to allow it to take in any object with an iterator over file IOs where each file has a .name entry....
My windows box also gives a few million (3M, to be exact.)
Okay, THANKS! My quick diagnostic pointed to eflist_get as the place where it's slow (not surprising), but then the issue is ... bit_array_get or select_rank? Maybe it makes sense to...