查询词典 directed graph

You can use Function Grapher to make Cartesian graph and polar graph.

您可以使用功能grapher作出笛卡尔图和极地图。

From this,I search for a way to identify the symmetry of the functional graph for the direct line or the central symmetry of the functional graph for the some dot.

这里将要向大家介绍的方法是利用一阶导数和二阶导数去判断曲线的对称性。

This paper reveals the relationship between the parity of derivative function and the symmetry of the graph function, finding a effective way to judge whether the functional graph can have the axial symmetry or central symmetry.

揭示了函数导数的奇偶性与函数图像对称性的关系，发现了一种可以用来判定函数图像是否具有轴对称性或中心对称性的有效方法。

In graph theory,we have the algebraic graph theory[8]which involving spectrum,chromatic polynomial and so on.

在图论中，我们有代数图论[8]，通过研究图的谱，色多项式等来研究图的性质。

This book in all 126 chapters, content involves cardiovascular disease foundation, not have achieve video learn, disease of valve of physiological, heart, aorta mixes report outside element of risk of week blood-vessel disease, coronary artery disease, cardiac muscle straightens dead, disease of heart and pericardium and pulmonary circulation disease, cardiac muscle and heart failure,, include 1400 plans, among them 483 are chromophotograph, kinetic draw writes down the radiative a collection of illustrative plates that covers electric physiology draw to write down image of graph, angiography, heart to be short of caustic and blood stream the graph.

该书共126章，内容涉及心血管疾病基础、无创影像学、电生理学、心脏瓣膜病、主动脉和外周血管疾病、冠状动脉疾病危险因素、心肌梗死、心脏和心包以及肺循环疾病、心肌病和心力衰竭、心脏药理学、有创及介入心脏病学等11个部分，包括1400幅图，其中483幅为彩色照片，涵盖电生理描记图、血管造影图像、心脏缺损的放射图谱以及血流动力学描记图等。

By using the character of Cayley graph, we establish the tight upper and the lower bounds of forwarding index for circulant graph.

利用循环图是Cayley图的性质，获得循环图的点转发指数和边转发指数紧的上界和下界。

The graph cliping algorithm is the basis of computer graphics algorithms.The graph cliping algorithm is good or not directly influence entire graphics system's performance.

图形裁剪算法是计算机图形学的基础算法，图形裁剪算法的好坏，直接影响到整个图形系统的性能。

It also constructs a lattice graph of frequent closed itemsets and generates association rules base on lattice graph.

GRG构造频繁项集的格关系图并在它的关系上生成关联规则。

X→Y has a closed graph are provided,and the classical closed-graph theorem is generalized.

本文给出了算子T具有闭图象的一些等价条件，并推广了经典的闭图象定理。

The new algorithm constructs an association graph to represent the frequent relationship between items, and recursively generates frequent closed itemsets based on that graph.

GRG算法构造关联图代表频繁项之间的频繁关系，并递归地从关联图中产生频繁闭项集。

They have quite a lot of work to do.

他们有许多工作要做。

Let us give you a more elaborate example of this process.

让我们给你这个过程的更多的详细例子。