Both dyadic and triadic relationships are local and never go farther than one edge (or one “hop,” as network researchers say) from any of the involved nodes. The purpose of the functions in this section is to take you far away—as far as your network can afford.
For that, you need definitions of a walk, trail, and path.
A walk in a network is any sequence of edges such that the end of one edge is always the beginning of another edge, except possibly for the first and last edges that may be connected only at one end.
A trail is a walk that never uses the same edge twice. A trail that does not intersect itself, but starts and ends at the same node, is called a cycle (a self-loop edge explainedhere is a cycle).
A path ...