As an example, let's ask Alice to join us.
Figure 8 (a) shows a node representing Alice. There are no edge in this figure, which means that Alice doesn't like herself. Figure 8 (b) has an edge from Alice to Alice, so now Alice likes Alice (herself).
![]() |
Figure 8: Graphs representing the relationship between Alice and herself. |
AliceAlice[0] For the case in which Alice likes herself (as shown in Figure 8 (b)), the adjacency matrix is the following:
AliceAlice[1]
This time, there is only Alice. This is the simplest relationships. Next time, we will see a bit more complicated relationships.
Comments