在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
其次，将频繁子图边扩展及同构判断这部分频繁子图挖掘算法中时间复杂度最高的部分并行处理。
Secondly, we processed the edge expansion and frequent sub-graph isomorphism which are the most complexity parts of frequent subgraphs mining in parallel.
这里有幅更好的图。我说经过C 的是 C左边的这个阴影平行四边形。
Here is a better picture. I claim that what will be going through C is this shaded parallelogram to the left of C.
让我们先把这种类似放在一边，来看一下图1，它说明了消息服务器的体系结构。
Let's put the analogy aside and have a look at Figure 1, which illustrates the architecture of the message server.
图10显示了带有报头、边导航、内容区域和注脚的基本网站结构。
Figure 10 shows a basic site structure with a header, side navigation, content area, and footer.
计算是结构化的，以有向图的方式进行：程序是图形顶点，而通道则作为图的边。
The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.
在这张图的上边，血管壁细胞模仿毛细血管，，在另一边，模拟肺癌细胞的肺上皮细胞。
On one side of the sheet, blood-vessel cells mimic a capillary wall; on the other, lung-cancer cells mimic lung epithelial cells.
一个简单的例子是创建这样一个图，顶点表示网站中的网页，而边表示页面指向另一个页面的链接。
One simple example is creating a graph where vertices are represented by a website's pages and edges exist between pages containing links to other pages.
查拉图斯特拉一边在心里说这番话，一边把尸体扛上了肩头出发了。
When Zarathustra had said this to his heart, he put the corpse upon his shoulders and set out on his way.
图的节点是资源和文字，节点之间用有向边连接，边上用谓词标记。
The nodes of the graph are resources and literals, and they are connected by directed edges, which are labeled with predicates.
将使新饼图的边变得平滑，把饼图的径向分区涂上白色，并且饼图的内部都会成为白色。
The edge of the new pie chart is smoothed, the pie radial divisors are colored white, and the interior of the pie chart is made white.
为边增加方向最终会创建一个属性图，它代表图形数据库中的明确结构。
Adding a direction to an edge ultimately creates a so-called property graph which represents the explicit structure of data inside a graph database.
如果把清单11所示的方法画成流程图（见图 1），就很容易算出边数和节点数并计算出圈复杂度。
If you diagram the method shown in Listing 11 into a flow chart, you can easily count the number of edges and nodes and calculate the cyclomatic complexity, as shown in Figure 1.
图8显示边栏背景的宽度如何随着浏览器窗口由窄变宽。
Figure 8 shows how the sidebar background widens as the browser view port is changed from narrow to wide.
图的每一条边都被存储了两次：一次正向存储(根据源id做索引和分块)，一次反向存储(根据目的ID做索引和分块)。
Each edge is actually stored twice: once in the "forward" direction (indexed and partitioned by the source ID) and once in the "backward" direction (indexed and partitioned by the destination ID).
图六：最后一点小常识：99%的名片只会去两个地方：发的人办公桌第一层抽屉或是收的人脚边的垃圾桶。
Fig6 a small tip: 99% of CARDS are in one of two places: the top drawer of the desk of the sender or the bin of the receiver.
对于一个社会化网络图，这些顶点id即用户id，但是对于“收藏”推文这样的边，其目标顶点(destinationid)则是一条推文的id。
For a social graph, these node IDs will be user IDs, but in a graph storing "favorite" tweets, the destination may be a tweet ID.
使用Dot语言，您可以指定三种对象：图、节点和边。
With the Dot language, you can specify three kinds of objects: graphs, nodes, and edges.
flow是一个有向图，活动被表示为节点，所谓的links被表示为连接活动的边。
A flow is a directed graph with the activities as nodes and so-called links as edges connecting the activities.
图11显示在边栏中选择Website(词汇13)的效果。
Figure 11 shows the effect of selecting Website, term 13, in the sidebar.
图8显示了框架中Observable一边的主要组件。
Figure 8 shows the main components around the observable side of the framework.
做思维导图是设计用来同时使用你两边大脑的的——做思维导图包括了左右脑思考。
Mind mapping is designed to use both sides of your brain-mind mapping involves your right and left brain thinking.
问海阁，绝无仅有的海景餐厅，标识牌设计它设在悬崖边，悬崖下就是大海，礁石、沙滩，这样的景色往哪看都是一幅美丽的海景图。
Asked the sea House, unique sea-view restaurant, signage design it in a cliff, the cliff is the sea, reefs, beaches, where to look is such a beautiful view of the sea chart.
在厨房里，一名来自北方的战士与一名图阿雷格族人在水槽前挽着袖子，一边聊天，一边洗碗。
In the kitchen, a northern fighter and a Tuareg man chatted over the sink, sleeves pulled up, while washing dishes.
她试图逼迫托伊达里亚君主卡图恩科国王站到分离势力一边，但她的计划最后被绝地大师尤达粉碎了。
She tried to pressure the Toydarian monarch, King Katuunko, into siding with the Separatists, but her plans where ultimately thwarted by Jedi Master Yoda.
最小化边交叉数是层次图绘制过程中的一个关键步骤，直接影响着层次图的可读性。
Minimizing edge crossing is a key problem in drawing layered digraphs, and it's directly involved with the readability of the graph.
船的另一边我把羽化范围设定在40%到60%之间，用曲线来营造一种平衡的光照效果。(图38)。
I used the feather tie set between 40% and 60% on the opposite side of the boat and curves to create the bounce lights (Fig. 38).
船的另一边我把羽化范围设定在40%到60%之间，用曲线来营造一种平衡的光照效果。(图38)。
I used the feather tie set between 40% and 60% on the opposite side of the boat and curves to create the bounce lights (Fig. 38).
应用推荐