一个结点 - 翻译成英语

• node

在 中文 中使用 一个结点 的示例及其翻译为 英语

正访问的是当前层的最后一个结点*/.
Update the last point to be the current point*/.

一个结点可以有多于一个的双亲。
A version may have more than one parent.

有且仅有一个结点s∈V{\displaystyles\inV}.
Contains a single point of V{\displaystyle V}.

根据连接强度（权重）和转换函数，激活值会被传送到下一个结点。
Based on the connection strength(weights) and transfer function, the activation value passes to the next node.

注：一条有向图上的路径可以经过一条边、或一个结点超过一次。
Note that on a given causal path, a single node might be traversed once or more than once.

支持设在Manno的瑞士科学计算中心作为计划中的欧洲地球观测网络(CEO)的一个结点。
Support the Swiss Scientific Computing Center in Manno as a node in the planned European network on Earth observation(CEO).

结点变量代表了树状结构中的一个结点，而且通常是配合XML处理的，这是专业而且更高级的话题。
Node variables represent a node in a tree structure, and are used mostly with XML processing, which is an advanced, and specialized topic.

点对点的连接通常是由两个定向天线构成的，其中一个负责网络中下一个结点，而另一个则负责前一个结点。
Point-to-point links typically consist of two directional antennas, one focused on the next node and the other on the previous node in the network.

如果一个结点是红色的，那么它所有的孩子都是黑色的。
If a node is red, then its children are black.

其中每一个结点是一个独立的数据库系统。
Every node is a separate database system.

如果一棵树只有一个结点，它的深度为1。
If a binary tree has only one node, its depth is 1.

现在我们想知道是否有一个结点的值为52。
Now we want to know if we have a node based on value 52.

树的每个数据元素称为一个结点。
Each data in the tree is called a node.

树的每个数据元素称为一个结点。
Each data item in a tree is called a node.

任何一个关键字出现且只出现在一个结点中；.
Any keyword appears and only appears in one node.

一个结点可以有多于一个的双亲.
A child may have more than one parent.

如果一个结点是红的，那么它的两个儿子都是黑的。
If a node is red, then both of its children are black.

但是当一个结点经历一次碰撞时，它不必立刻重发该帧。
But when a node experiences a collision, it doesn't necessarily retransmitting the frame right away.

当一个结点生成一个新块时，它会在网络上散布这个块。
When a node generates a new block, it broadcasts it to the network.

如果一个结点是红色的，则它的两个儿子节点都是黑色的。
(4) If a node is red, then both its children are black.