Communicator Graph - LucPrestin/Hidden-Modularity GitHub Wiki
The Communicator Graph uses the following mapping between the trace data and the visualization parameters:
The communicating objects are aggregated to their class. For each class a node with corresponding label is created. The color is used to show the communicating objects' class membership to a package.
The senders and receivers are used to calculate the edges between the nodes. This then indirectly affects the size and distance of the nodes. The size of the nodes is calculated using the number of incoming and outgoing edges. The distance is based on the edge weights. In general, all nodes repel each other. However, those nodes with an edge between them are pulled together with a force equal to the edge weight.
Example:
The example is taken from the scenario Opening a Morph in the World.