Graphs.jl

Graphs.jl copied to clipboard

Added edge-betweenness.jl to centralities

3

I have added a new file `edge-betweenness.jl` to `src/centrality/`. Here I include a function to compute the edge betweenness of a graph (directed and weighted). In theory I could also...

jwassmer

Modify `non_backtracking_matrix` function's Return Type

4

As mentioned in #326, I modified `non_backtracking_matrix` so that it returns a spase matrix.

KeishiS

two sided dijkstra

6

Implemented the Two sided Dijkstra algorithm, still requires documentation and tests

Dolgalad

Greedy modularity optimization community detection algorithm

2

Greedy modularity optimization algorithm as per [paper of Newman](https://arxiv.org/abs/cond-mat/0309508)

olegfafurin

Question regarding `non_backtracking_matrix` function's return type

1

Thank you for your ongoing development efforts. I have a question concerning the `non_backtracking_matrix` function. I noticed it returns a non-sparse matrix, whereas the `adjacency_matrix` function returns a sparse matrix....

KeishiS

Algorithm for finding the longest path of a DAG

15

DAG longest path algorithm.

matheusdiogenesandrade

mentioned in #219

mojaie

[BUG] `yen_k_shortest_paths` doesn't work with Unitful (i.e., `Number`) weights

1

**Description of bug** Passing an array of `Unitful.jl` doesn't work with `yen_k_shortest_paths`. It's because no method is defined to accept weights of `AbstractMatrix{ g = SimpleGraph(5) julia> ws = [v1...

filchristou

https://aviatesk.github.io/JET.jl/dev/optanalysis/

gdalle

Question on neighbours functions returning a reference

9

Question - the Graphs.inneighbors, Graphs.outneighbors and consequently Graphs.neighbors specify that they return a reference to the current graph's internal structures, rather than a copy. Having fallen afoul of this, I...

jward0