DiskNet#
- class DiskNet(pars=None, key_dict=None, **kwargs)[source]#
Bases:
NetworkDisk graph in which edges are made between agents located within a user-defined radius.
Interactions take place within a square with edge length of 1. Agents are initialized to have a random position and orientation within this square. On each time step, agents advance v*dt in the direction they are pointed. When encountering a wall, agents are reflected.
Edges are formed between two agents if they are within r distance of each other.
Attributes
betaRelative transmission on each network edge
membersReturn sorted array of all members
nowShortcut to self.t.now()
p1The first half of a network edge (person 1)
p2The second half of a network edge (person 2)
statesReturn a flat list of all states
statesdictReturn a flat dictionary (objdict) of all states
tiGet the current module timestep
timevecShortcut to self.t.timevec
Methods