图的节点是资源和文字，节点之间用有向边连接，边上用谓词标记。
The nodes of the graph are resources and literals, and they are connected by directed edges, which are labeled with predicates.
所有的活动都用箭头链接在一起，称为有向边，它指出从一个活动到下一活动的流向。
All of the activities are linked together using arrows, called directed edges, that indicate the flow from one activity to the next.
请注意，如果并非所有的道路都是单行道，那么我们可以在图中为每一条双行道画两条有向边，每条边指明一个方向。
Note that if not all of the streets are one-way, then we can obtain a digraph by drawing for each two-way road two directed edges, one in each direction.
计算是结构化的，以有向图的方式进行：程序是图形顶点，而通道则作为图的边。
The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.
奖励的设置必须确保在业绩和留任之间有一个平衡，此时天平过于向留任的一边倾斜。
They also need to ensure that the incentives are designed correctly to balance performance and retention.
flow是一个有向图，活动被表示为节点，所谓的links被表示为连接活动的边。
A flow is a directed graph with the activities as nodes and so-called links as edges connecting the activities.
在这里，费希特曾经把它所有的方式向另一边，心里总是说，我们采取了什么塑造那里有一些其他类型的现实。
Here, Fichte has pushed it all the way to the other side and says the mind is always shaping what we take to be some other kind of reality out there.
有一天，当他在海湾边的人行道上漫步欣赏海景时，他丢失了一个装着钱和护照的信封，于是向当地的大使馆寻求帮助。
One day, when he was wandering on the pavement near the bay enjoying the sea scenes, he lost his money and passport that he kept in an envelope.
而使用新方法可以得到NC算法，且可以证明节点和边都有容量的有向平面网络中的最小截、最大流问题都是属于NC的。
It is proved that the minimum cut and maximum flow problems in directed planar networks with both node and edge capacities are both in NC.
那个小伙子有一种很特殊的神情，就是在他说话时，身子总是向一边斜着，头探到肩膀外面。 收藏。
The lad has a remarkable manner of standing sideways as he spoke, and thrusting his head forward over his shoulder.
在一定条件下简单有向图的完全关联矩阵中列向量线性相关时，它们对应的边构成回路。
In some condition, if column vectors in a complete incidence matrix are not linearly independent, these sides which are denoted by the column vectors formed a circuit.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
The optimization problem of constructing a K-edge-connected directed graph from any given directed graph by adding a minimum set of edges is studied.
大街两边的人们叫喊着，吹着口哨，向那红色的车摇着藤条，指着那个有魄力的、扛着掉下来的轮胎追赶汽车的托马斯。
On both sides of the avenue people were shouting, whistling, and waving canes at the red car, pointing to the enterprising Thomas coming up with the lost tire.
在一楼，有一扇玻璃作为主要入口使用，向两边滑动就露出了厨房。
On the ground floor, one of these Windows serves as the main entry, and slides open to reveal the kitchen.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
运动图方法是一种有效地组织运动数据的方法，运动图的本质是一种由结点和边组成的有向图。
Motion graph method is an effective method of data organization, motion graph is a directed graph composed of nodes and edges.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
应用推荐