In the first method, a graph-based model is built through analyzing system dataflow, and the survivability is computed with the graph connectivity.
第一种方法建立基于数据流的图模型，通过图的连通性计算生存性。
Connectivity, maxima and minima, and other graph and matrix concepts are explained here.
连通性、最大通路和最小通路以及其他图和矩阵的概念在本章中都进行了介绍。
Now that the compact function connectivity matrix is built, it's time to build its graph.
现在我们已经构建了简化的函数连通性矩阵，接下来应该构建图形的表示了。
Let's dig into Graphviz to understand how a call graph is generated from the connectivity matrix.
让我们深入研究Graphviz，了便理解如何从连通矩阵生成一个调用图。
In addition to cloud-connectivity, the use of a user's location to set context and their social graph to drive adoption is becoming nearly ubiquitous.
除了云端接入之外，使用用户地理位置设定相关情境，利用社交图谱增进应用接受度几乎无处不在。
Connectivity sieve is one of several sieves that are applied during the course of modeling of disassembly AND-OR graph.
连通性筛子是构建拆卸与或图拆卸模型的诸多筛子之一。
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 connectivity sieve was used to delete illogical vertices from the disassembly andor graph, which reduced the number of vertices.
通过连通性筛选，剔除了拆卸与或图中的不合理部件顶点，并使顶点数量得到有效削减。
The edge-edge connectivity of a graph is defined, and a class of quasi-regular graphs is proposed with a maximum edge-edge connectivity.
定义了图的边边连通度，设计了一类具有最大边边连通度的拟正则图。
This paper argues first that atomic parts of a connected circular graph are still connected circular graphs. It also gives some natures about connectivity of connected circular graphs.
本文首先得到了循环图的原子部分仍为连通循环图的结果，同时还得到了连通循环图的连通度的一些性质。
Is not connected to the output of its various connectivity graph branch (c).
对不连通的图输出其各个连通支(C)。
By using the graph theory and the method of data transformation, a series of connectivity matrixes and loop matrixes are derived from the basic relation matrix-the matrix KL.
应用图论理论和数据转换方法，通过基本关系矩阵———KL矩阵派生一系列的衔接矩阵和回路矩阵。
In this thesis, we mainly study the super restricted edge connectivity for several graph-classes.
本文主要研究了几类图的超级限制边连通性。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
应用推荐