amritagos
commented
1 year ago - Split the adjacency_list (which was a vector of vector of tuples) into two list of lists: the neighbour list, containing the neighbour indices of each agent (vector of vector of size_t), and the weight_list (vector of vector of doubles), containing the interaction weights for each pairwise interaction between agents i and j
- Added an implementation of Tarjan's algorithm which determines whether the initialized network is strongly connected or not. Prints a warning if the network can be decomposed into more than 1 SCC (strongly connected component).
- Added a micromamba environment and install instructions in the README