Nicholas Landry

When nodes are dragged, labels stay on for that node

6

Not sure if I am interacting with netwulf incorrectly, but after running the following code, ``` import networkx as nx from netwulf import visualize G = nx.barabasi_albert_graph(100,2) visualize(G) ``` with...

Node-edge centrality is primarily defined in centrality.py but is also referenced in both nodestats and edgestats.

Compress edges

6

Implement way of collapsing identical elements. Right now, `IDView.duplicates()` simply chooses the lowest ID as the non-duplicate edge, but there are several ways of - weighting the collapsed nodes/edges: 1....

Add features to `degree_histogram`

6

I wanted to easily visualize the degree/edge size distribution and the way that I found easiest to get both was the following: ``` degrees = dict(H.degree()) edge_sizes = dict(H.edge_size()) d,...

Degree assortativity functions don't handle empty hypergraphs

1

Returns `IndexError`.

Hypergraph operations

8

It would be cool to define the add and subtract methods (and maybe other methods?) for hypergraphs.

Add support for directed hypergraphs

4

It would be good to add a class that allows users to specify a directed hypergraph. I've seen several ways to do this, but not sure which is best.

`remove_simplex_id` enforces removing all subfaces as well and calls `remove_simplex_ids_from` to do so. Because of this, `remove_simplex_ids_from` does not enforce simpliciality. I think that `remove_simplex_ids_from` should call `remove_simplex_id` and either...

For the methods in the `convert.py` file, the `create_using` keyword is used to indicate the constructor to be used to add edges from. This may be unnecessary and potentially should...

new add method

2

Allows users to add two hypergraphs together. This reindexes all edges and keeps them all.