Simone Balducci

I'll look into it.

If the graph is undirected then we can same some execution time by only checking the upper triangle of the adj matrix, because other triangle will be identical but inverted....

The keys of the map are the source nodes, and for every source node you have a vector of edge/destination node pairs. If a node is not the source of...

``` template shared Graph::getAdjMatrix() const { auto adj = std::make_shared(); auto addElementToAdjMatrix = [&adj](shared nodeFrom, shared nodeTo, shared edge) { std::pair elem = {nodeTo, edge}; (*adj)[nodeFrom].push_back(std::move(elem)); }; for (const auto...

I was thinking about this. Maybe this could be done by adding a layer of inheritance to the Nodes, similar to the structure of the Edges. We could simplify `Node`...

> Good Idea! I think we can proced. If you want I can work on this.

Yes, those are the tests where we read a graph from file (dot or mtx). If you run from some other folder the relative path is not correct anymore.

I agree, `MIT` and `MPL` are the best options. The project is getting large, so maybe if many people start using it `MPL` would be better.

I think that we should. The only problem that a collegue of mine pointed out is that in order to change the license we should ping to this issue all...

> @sbaldu That sounds right to me. > > Looks like another project solved this recently: [Technologicat/pyan#68 (comment)](https://github.com/Technologicat/pyan/issues/68#issuecomment-852888394) > > They had contributors post a message "I approve re-licensing my...