Simone Balducci

Inclusion of "sink nodes" in adjacency map

1

This issue is related to the discussion in issue #367. When we build the adjacency matrix for a directed graph we only add an element for the source node. ```...

Add Graph method for betweenness centrality

2

I think it would be useful to add methods in the Graph class for calculating the betweenness centrality of a node and maybe also other centrality measures (eigenvalue centrality, closeness...

Provide functions for exporting matrices as sequential data types

1

We currently define the adjacency matrix (and all other matrices) as hash maps, and this is the most optimal choice, but I was thinking that it would be useful to...

Define `pow` function for graph matrices

4

Users might want to calculate a power of the Graph matrices (adjacency for the number of shortest paths, transition for simulating markov chains ecc.). It would be useful to provide...

Implement creation of view for generic contiguous range

5

This PR generalizes the construction of host views from standard containers to generic contiguous ranges using concepts.