In this thesis, the concept of L-graphfor a complete lattice with a largest element 1 and a smallest element 0 (0≠1)is introduced, which is generalization of fuzzy graph, and the main properties ofL-graphs are studied systematically.
在此基础上,本文就有最大元1和最小元0(0≠1)的完备格L,给出了L-图的概念(它是模糊图的推广),并较为系统地研究了L-图的一系列性质。
参考来源 - L·2,447,543篇论文数据,部分数据来源于NoteExpress
This is in contrast to selection sort where you're fishing looking again and again for the smallest element.
这与选择排序形成了对比,在选择排序中,你一次又一次地完成寻找最小的元素。
Smallest element at the front.
好的,最小的元素到前面了。
Suppose you want to find the smallest element in an array.
假设你要查找数组中的最小元素。
And this is in contrast to Selection Sort where you're fishing again and again for the then smallest element.
这与选择排序是相反的,在选择排序中你需要一次又一次地,找出最小的元素。
In the second case, I found in the next smallest element and moved here, taking what was there and moving it on, in this case I would swap the 4 and the 8, and in next case I wouldn't have to do anything.
在第二次遍历中,我找到了,第二小的元素,把它移到这里,把这里原来的元素移到哪里,在这一次遍历中,我会把8和4交换,然后一次遍历,不会做任何事情。
It's as though I've walked across the stage like this realized, damn, it was the guy over here or rather I found the smallest element here who beat out number 2 over here so I can now put number 1 into place and recall that it didn't matte if I punted whoever was standing here 'cause they were given to me randomly anyway.
这就像是我这样走过讲台,然后才发现要找的人在那儿,或者说发现了最小的元素,那么就可以将1号放在正确的位置,而在这儿的是谁并不重要,因为他们本身就是,随机的。
应用推荐