## FANDOM

32.617 Seiten

Consider a network representing a symmetrical relation, “communicates with” for a set of nodes. When a pair of nodes (say, u and v) is linked by an edge so that they can communicate directly without intermediaries, they are said to be adjacent. A set of edges linking two or more modes [sic] (u, v, w) such that node u would like to communicate with w, using node v. Consider a graph representing the symmetrical relation, "communicates with" for a set of people. When a pair of points is linked by an edge so that they can communicate directly without intermediaries, they are said to be adjacent. A set of edges linking two or more points $(p_i, p_j, p_k)$ such that $p_i$ is adjacent to $p_j$ and $p_j$ is adjacent to $p_k$ constitute a path from $p_i$ to $p_k$.