self-loopn.

Brit.

/ˌsɛlfˈluːp/, U.S.

/ˌsɛlfˈlup/

Origin: Formed within English, by derivation. Etymons: self- prefix, loop n.¹

Etymology: < self- prefix + loop n.¹

Mathematics.

In a graph or network: an edge that begins and ends at the same vertex. Cf. loop n.¹ 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).

单词	self-loop
释义	self-loopn. Brit. /ˌsɛlfˈluːp/, U.S. /ˌsɛlfˈlup/ Origin: Formed within English, by derivation. Etymons: self- prefix, loop n.¹ Etymology: < self- prefix + loop n.¹ Mathematics. In a graph or network: an edge that begins and ends at the same vertex. Cf. loop n.¹ 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
随便看	requiescats requiesce requiescence requietory requinto requirable requiral requirance requirant require required required reading required to requiredness requirement requirements requirer requirers requires requiring requirings requiry requise requisite requisite variety