If you're unfamiliar with business process modeling and workflows, Figure 1 provides a basic example of a simple workflow process; it is an example of a directed-edge graph.
如果您对商业流程建模和工作流不太熟悉，图1提供了一个简单的工作流的基本示例。
Every day they push out an updated multi-billion edge probabilistic relationship graph to their live site for querying in rendering web pages.
它每天都会向其站点推送出几十亿的边缘概率关系图，用于渲染网页时查询所用。
XML-based query languages are constructed to reach any arbitrary position within an XML document's "graph" using sequences of edge labels and delimiters representing a path.
基于XML的查询语言被构造来，使用表示路径的边标签和定界符序列达到XML文档图中的任意位置。
The dot syntax language-building program shown below will process the various edge attributes automatically to emphasize the linkages and create the graph we defined loosely.
下面所示的dot语法语言构建程序将自动处理不同的边属性，从而强调链接并创建定义宽松的图形。
I've also applied an optional attribute to the edge — label — that names the edge on the graph.
我还对边使用了一个可选的属性label，用它来表示边在图中的名称。
Custom edge shapes, colors, and many other modifications to the graph syntax-generation steps are suitable for enhancing the visualizations.
定制边的形状、颜色以及图形语法生成步骤中的其他修改，从而增强可视化效果。
Adding a direction to an edge ultimately creates a so-called property graph which represents the explicit structure of data inside a graph database.
为边增加方向最终会创建一个属性图，它代表图形数据库中的明确结构。
The algorithm first makes a top-down coarse location using the projection analysis of the edge density graph and then makes a bottom-up precise location based on the vertical edge linkage intensity.
该算法首先通过对边缘密度图进行投影分析进行自顶向下的粗定位，然后在此基础上利用垂直边缘的连接强度进行自底向上的精确定位。
Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph.
最小化边交叉数是层次图绘制过程中的一个关键步骤，直接影响着层次图的可读性。
Compared with traditional technology, the present invention has the advantages of shortened etching time, raised etching efficiency, regular edge of resistance stripes and high graph quality.
本发明与传统的方法相比，缩短了刻蚀的时间，提高了刻蚀工艺的效率，电阻条边缘整齐，图形质量高。
In this paper, three measure of the connectedness of a fuzzy graph: fuzzy connectivity, fuzzy edge connectivity, fuzzy nuclearity and their properties are presented.
本文给出了衡量模糊图连通性的三个度量：模糊连通度、模糊边连通度与模糊核度及其相关的性质。
The homeomorphism classification of graph like manifolds can be transformed into a 2 edge colouring enumeration problem for graphs.
图式流形的同胚分类可转化为图的一类2 -边着色计数问题。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
The graph with a quasi-strong edge colourings is called the quasi-strong edge colouring graph. This paper gives a classification for the quasi-strong edge colouring graphs.
具有准强边着色的图称为准强边着色图，并对准强边着色图给出一个分类。
The edge distinguishing number of a graph G is the minimum number of the distinguishing labelings (colors) of the edges in G for which destroys the symmetries of G.
图的边可区别数是破坏图对称性的最小可区别的边标号数（颜色数）。
This paper proposed a new contour reconstruction method combining multi-scale strategy, and the core component of new method is edge distance graph algorithm.
设计了一种将轮廓线三维建模与多尺度二维图像处理技术相结合的新方法。该方法的核心是边缘距离图算法。
Besides, the compression mechanism of Dynamic Bit Vector (DBV) was used to store the edge weights in undirected graph to improve the spatial storage efficiency of the algorithm.
此外，采用一种动态位向量(DBV)的压缩机制对无向图中边的权重进行压缩存储，以有效地提高算法的空间存储效率。
Every edge in the adjacency graph corresponds to exactly one edge in the shape graph.
邻接图的每条边都对应于形状图的边缘。
In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.
如果6连通图的一条边收缩后使得所得到的图仍是6连通，则这条边称为6可收缩边。
The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
得到了扇和完全等二部图联图的边色数。
But it's so close to the edge of the graph that it's kind of hard to see.
但是他太靠近图像的下方了，所以很难看的见。
EDIT: I guess I should have mentioned that this USES the edge list form of a graph.
编辑：我想我应该提到它使用列表形式的边缘图。
Some upper bounds of the edge number for two class planar graphs are given. Some sufficient conditions for a planar graph to be class 1 are obtained through these bounds of edge number.
给出了平面图为第一类图的边数的一些上界，并给出了平面图为第一类图的一些充分条件。
Some upper bounds of the edge number for two class planar graphs are given. Some sufficient conditions for a planar graph to be class 1 are obtained through these bounds of edge number.
给出了平面图为第一类图的边数的一些上界，并给出了平面图为第一类图的一些充分条件。
应用推荐