释义 |
ˈself-loop [self- 3 a.] In a graph or network, a line that returns to the node it leaves.
1964S. E. Salmaghraby in Managem. Sci. X. 499 We shall reserve the terms ‘self-loop’ to designate a branch that leads from a node to itself. 1980Sci. Amer. Mar. 18/1 In graph theory a graph is defined as any set of points joined by lines, and a simple graph is defined as one that has no self-loops (lines that join a point to itself) and no parallel lines (two or more lines joining the same pair of points). |