///A graph in which all individuals that can mate with p > 0.05 are
///connected
using individual_graph
= boost::adjacency_list<
boost::vecS, boost::vecS, boost::undirectedS, indiv
>;
I suggest, to instead of the data type, use the idea of the graph: it connects those individuals that can mate.
Now the definition is as such:
I suggest, to instead of the data type, use the idea of the graph: it connects those individuals that can mate.