To allow experiments in traditional style well-mixed populations, create a well-mixed topology.
This could be done as either a graph with no edges. The topology would have to overwrite the basic Topology get_neighbors method and return a list of randomly-selected neighbors. The number of neighbors would be a parameter.
A second option would be a complete graph. This would also require a parameter to define the size of the neighbor list (pick a subset of the nodes randomly). The big downside is that this would prohibit large populations, as a complete graph takes a lot of time and memory.
To allow experiments in traditional style well-mixed populations, create a well-mixed topology.
This could be done as either a graph with no edges. The topology would have to overwrite the basic Topology get_neighbors method and return a list of randomly-selected neighbors. The number of neighbors would be a parameter.
A second option would be a complete graph. This would also require a parameter to define the size of the neighbor list (pick a subset of the nodes randomly). The big downside is that this would prohibit large populations, as a complete graph takes a lot of time and memory.