单词 | self-loop |
释义 | self-loopn. Mathematics. In a graph or network: an edge that begins and ends at the same vertex. Cf. loop n.1 Additions. ΚΠ 1953 Proc. IRE 41 1953/2 When a feedback graph is simplified to a residue containing only sources, sinks, and index nodes, one or more self-loops appear. 1980 Sci. 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. 2009 Ann. Probability 37 2332 The graph is simple,..it neither contains any self-loop at some vertex, nor contains multiple edges between two vertices. This entry has been updated (OED Third Edition, January 2018; most recently modified version published online March 2022). < n.1953 |
随便看 |
|
英语词典包含1132095条英英释义在线翻译词条,基本涵盖了全部常用单词的英英翻译及用法,是英语学习的有利工具。