对于四近邻的图像，建立了一组最小的完备图。

The minimum sets of complete graphs are obtained respectively for 4-site neighborhood digital images.

youdao

对于八近邻和四近邻的图像，分别建立了一组最小的完备图。

The minimum sets of complete graphs are obtained respectively for 8-site neighborhood and 4-site neighborhood digital images.

youdao

最完备的方法是RDF：一种强大的基于图的语言，用于表示事物、属性及事物间的关系。

The most comprehensive approach is RDF - a powerful, graph-based language for declaring things, and attributes and relationships between things.

youdao

One of the things we said last time was, with that set of things, the ability to give values-- sorry, to give names to values-- the ability to make decisions, the ability to loop as a function of that, the ability get things in and out, we said that that actually gave us a language we said was Turing-complete.

上次我们和以上内容一起说过，我们可以赋值--抱歉,为数值命名--可以做出判断决定-,并且据此进行循环,可以输入输出数据,我们说拥有这些功能的语言,是图灵完备的。

麻省理工公开课 - 计算机科学及编程导论课程节选