I have the dataset from survey with participants IDs and IDs of another participant (or participants) that first participant knows, just like this:
| Participant ID | Knows participant |
|---|---|
| 111 | 353 |
| 111 | 777 |
| 111 | 112 |
| 111 | 249 |
| 112 | 143 |
| 112 | 144 |
| 113 | 111 |
| 113 | 244 |
| 114 | NaN |
| 115 | 113 |
| ... | ... |
| 777 | 111 |
| 777 | 398 |
| 777 | 114 |
| 778 | NaN |
| 779 | 112 |
| 3499 | NaN |
As you can see, some participants do not know any other participants (but it does not mean, that other participant also does not know him/her), however, some participants know 1, 2, 3 or even more other participants (and again some participants might does not not her/him ans vise versa).
So is it possible to build and visualize all possible connections between each participant (personal acquaintance, acquaintance through another participant and so on)?
CodePudding user response：
I'd use a simple chord diagram to show these connections. Chord diagrams can be created in PBI, Python or R.
