The nodes of the graph are resources and literals, and they are connected by directed edges, which are labeled with predicates.
图的节点是资源和文字，节点之间用有向边连接，边上用谓词标记。
It models the basic process and only simple directed edges that control the flow of processing logic from one activity to the next.
该模型包括一些基本的过程以及简单的有向图，这些边框控制着从一个活动到下一活动的处理逻辑流程。
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.
请注意，如果并非所有的道路都是单行道，那么我们可以在图中为每一条双行道画两条有向边，每条边指明一个方向。
This paper gives the direct approaches for topological analysis and synthesis of hybrid single contact switching networks which contain both undirected and directed edges.
本文给出既含无向边又含有向边混合单触点开关网络的拓扑分析与综合的直接方法。
When we are directed to something the team think might be suitable we then go and physically scope it out, measuring up and drilling along the edges to check the ice thickness.
当行动小组指出一处他们认为可能适合降落的地区后，我们就去那里实地察看和丈量，同时沿着其周边冰面钻孔以测量冰层厚度。
The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.
计算是结构化的，以有向图的方式进行：程序是图形顶点，而通道则作为图的边。
A flow is a directed graph with the activities as nodes and so-called links as edges connecting the activities.
flow是一个有向图，活动被表示为节点，所谓的links被表示为连接活动的边。
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.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
To construct a valid smoothness constraint, an edge-directed tensor diffusion is used, which can automatically select to denoise or to enhance edge according to the direction of edges.
在光滑性约束项的构造上，构造了一种基于边缘定向扩散的各向异性张量型扩散方程，能有效地根据边缘的方向确定是增强边缘还是滤除噪声。
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.
本文研究了以最小边集扩充一个任意有向图为K边连通有向图这一优化问题。
Motion graph method is an effective method of data organization, motion graph is a directed graph composed of nodes and edges.
运动图方法是一种有效地组织运动数据的方法，运动图的本质是一种由结点和边组成的有向图。
Motion graph method is an effective method of data organization, motion graph is a directed graph composed of nodes and edges.
运动图方法是一种有效地组织运动数据的方法，运动图的本质是一种由结点和边组成的有向图。
应用推荐