-
Let's look at developer centrality metrics (degree, closeness, and betweness) and see if those are correlated with number of sheriff hours. Do all of this at 2-month intervals - so sheriff hours withi…
-
The documentation on `communicability_centrality()` says that it calculates communicability centrality which is also know as subgraph centrality according the documentation. But communicability centra…
-
@sbromberger why do you think we should be eliminating dependencies?
-
Hi,
First of all, thank you for this great piece of software. Coming from R I was frustrated by the weak performance and I am delighted by the possibilities Julia and LightGraph offer for social netw…
ghost updated
8 years ago
-
Hi everybody,
I like networkx a lot for and use it very often for my research. At the moment however, there is only the pagerank algorithm for computing the influence of nodes within a given graph. D…
-
Sphinx version 1.3.1 contains a bug in autosumary that doesn't allow it to work with our (and the commonly used) syntax. The one-line code fix in https://github.com/sphinx-doc/sphinx/pull/1892 works …
-
This issue is where we'll discuss the network analysis component. We can post graphs, code snippits, and brainstorms.
The network analysis project aims to find cluster of co-occurrence between depart…
-
Some arguments for nodes, labels and possibly edges might be read from the `network` object attributes, as in [this example](https://gist.github.com/briatte/5974895) that reads the mode.
Arguments th…
-
I ran into this one with LightGraphs (since I used your katz code there):
```
julia> g = evolving_graph(Int, String)
Directed EvolvingGraph (0 nodes, 0 edges, 0 timestamps)
julia> add_edge!(g,1,2,"t…
-
I discovered Julia recently, and was originally put-off by the complicated approach of Graphs.jl. As someone who uses graphs everyday, I can say that the simplicity of the library is a major adoption …
rlouf updated
9 years ago