-
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
-
Since `[bi]connected_components` and friends do not yield components sorted by their order, we could add functions to get the largest connected component. It's a quite common operation to build a grap…
-
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
-
I'm trying to use betweenness centrality to arrange a force-directed graph so that nodes with highest centrality are placed more centrally, but I can't work out quite how to call Viva.Graph.centrality…
-
Original ticket https://networkx.lanl.gov/trac/ticket/509
Reported 2011-02-16 by mkuhnert, assigned to @hagberg.
Hi everybody,
during working with centralities based on shortest paths algorithms (cl…
-
Hi,
the Katz centrality for directed graphs uses the outgoing links instead of the incoming links:
```
for n in x:
for nbr in G[n]:
x[n] += xlast[nbr] * G[n][nbr].get(weight,1)
```
As …
lamda updated
10 years ago
-
Generate the graphs for paper co-authorship and common proyects. From this graph is possible to calculate the centralities, clusters/modularity/k-core, etc.
We can use both of them to show different …