Graphs.jl

Graphs.jl copied to clipboard

Community detection algorithms

3

There seems to be a dearth of community detection algorithms in the current Graphs.jl. Hopefully this can be remedied in the future, and to that end I thought I'd list...

tecosaur

[BUG] cycle_basis not returning the correct number of cycles

9

**Description of bug** The cycle_basis without root parameter has a problem with a graph in the shape of the following molecule: https://pubchem.ncbi.nlm.nih.gov/compound/149096 With root, the result is inconsistent depending on...

shuettel7

Make benchmarks operational and clean them up

2

- [ ] See what they're doing - [ ] Make them compatible with PkgBenchmark.jl - [ ] Run them on CI? Links: - https://github.com/JuliaCI/PkgBenchmark.jl - https://github.com/tkf/BenchmarkCI.jl

gdalle

Should undirected edges == and hash be undirected?

4

Edges for `SimpleGraph` still consider their directedness when testing for equality and hashing. This is understandable given that `SimpleEdge` is used for directed graphs also. Is it worth considering adding...

DylanModesitt

degree of loops

1

I must feel stupid, but on every reference I encounter, a self-loop (undirected) counts for 2 in the degree of a node. This is the behavior on NetworkX (and I...

etiennedeg

Add example of API implementation to the docs

6

Maybe even an interface check with RequiredInterfaces.jl? I think we can make it nonbreaking

gdalle

`clique_percolation` takes enormous memory and never finishes on a large graph

1

**Description of bug** Hello, I was using the clique_percolation function to detect communities. It works for some of my networks, but for some other a bit more complicated ones, e.g....

wangyi91

Move testing to `GenericGraph`

3

We recently introduced two types called `GenericGraph` and `GenericDiGraph` that wrap a `SimpleGraph` or a `SimpleDiGraph`. These generic types try to fulfill the `AbstractGraph` interface in a minimal way, while...

gdalle

New Feature: Laplacian Centrality

1

Hello there, I am opening this issue to discuss the possibility of implementing a new centrality measure called `Laplacian Centrality`. I found it very interesting and would have liked to...

SimonPop

Many operations require a modifiable graph

2

For `induced_subgraph` that shouldn't be necessary See #274

gdalle