邻接矩阵

词组短语

adjacency matrix

与邻接矩阵相关的网络例句 [注：此内容来源于网络，仅供参考]

The adjacent matrix is a matrix, which, if and only if vertex and adjacent.

的邻接矩阵是一个的矩阵，其中，当且仅当顶点和邻接。

Although the adjacency matrix was a storage structure of finite automaton in common use, it was not proper to store all kinds of finite automata.

尽管邻接矩阵是有穷自动机的一种常用存储方法，但是，邻接矩阵并不适合存储所有类型的有穷自动机。

The main advantages of EGGLE include:the fixed neighborhood parameter k,only one time for constructing neighborhood graph and geodesic distance matrix,only needing to choose generalized Gaussian functions many times for constructing many Laplacian matrixes,obtaining multiple independent low-dimensional coordinate sets, independently training multiple classifiers,and combining classification results of these component classifiers to produce the final identification.

3提出了一种基于GGLE的集成判别算法，该算法的主要优点是：近邻参数k固定，邻接矩阵和测地线距离矩阵都只构造一次，只需要多次选择广义高斯型函数构造多个拉普拉斯矩阵，获取多个独立的低维空间坐标集合，独立学习分类器，集成分类识别。

Adopt incidence matrix to express network topology. Through searching and revising the incidence matrix, the zoned feeder and its network equivalent process are realized.

采用邻接矩阵表示网络拓扑，通过对邻接矩阵的搜索和修改实现馈线的分区以及网络的等值过程。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

use KRUSKAL margination array of GE s minimum spanning tree, each side of a tree stored in an array in C and category adjacency matrix is given the realization of the final major of the adjacency matrix to test the operation and output results.

利用KRUSKAL方法求边集数组的GE的最小生成树，树中每条边一次存于数组C中并给出了邻接矩阵类的实现，最后对邻接矩阵类主要操作进行测试，并输出运行结果。

So with the adjacency matrix that has n vertices of a directed graph n2 units needed to store the adjacency matrix; on n vertices have an undirected graph Zexu into upper triangle, and only ...

因此用邻接矩阵来表示一个具有n个顶点的有向图时需要n2个单位来存储邻接矩阵；对有n个顶点的无向图则需存入上三角形，故只。。。

The former firstly establishes state graph of power system, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffering greatly from the outages of overload lines through simple calculation of matrix.

前者根据实时网络拓扑结构和潮流分布状态，在对初始电力网络简化、分区的基础上，利用有向图的邻接矩阵与路径矩阵，通过简单的矩阵运算，快速识别出与过载线路相关的关键输电断面；后者直接利用系统各支路的阻抗，从图论算法的基本思想出发，搜索最易遭受大负荷转移的关键传输路径，从而将安全性分析目标从整个网络缩小到某些关键的输电线路。

The Laplacian matrix of G is the difference of degree matrix of G and the adjacent matrix of G, And the Laplacian spectral radius of a graph is the maximum eigenvalue of the Laplacian matrix of G.

图G的拉普拉斯矩阵为图G的度矩阵和它的邻接矩阵之差，而图G的拉普拉斯谱半径为图G的拉普拉斯矩阵绝对值最大的特征值。

In this paper,lower bounds on the spectral radius of adjacency matrices of trees and perfect trees are discussed by algebraic method and edge switching of graph,and all trees which reach lower bounds on the spectral radius are obtained.

利用代数方法、图的边变换，以及树的邻接矩阵谱与L ap lacian谱的关系，研究树和完美树的邻接矩阵谱半径和L ap lacian谱半径的下界，给出达到下界的所有极树，得到的新结果改进了文献[2]的结论。

与邻接矩阵相关的网络解释 [注：此内容来源于网络，仅供参考]

adjacency matrix：邻接矩阵

1 一般树的表示 5.5.2 二叉树与树之间的转换 5.5.3 一般树的遍历 5.6 哈夫曼树及其应用 5.6.1 哈夫曼树(最优二叉树) 5.6.2 哈夫曼树的应用 第6章 图 6.1 图的定义和术语 6.2 图的存储结构 6.2.1 邻接矩阵(adjacency matrix) 6.2.2 图的

adjacency matrix method：邻接矩阵表示法

adjacency list method 邻接表表示法 | adjacency matrix method 邻接矩阵表示法 | algorithm 算法

Adjazenzmatrix adjacency matrix：邻接矩阵

Addition addition 加法 | Adjazenzmatrix adjacency matrix 邻接矩阵 | adjungiert adjunct; adjoint 附属的;伴随的

adjacent channel：邻近信道

adjacency matrix 邻接矩阵 | adjacent channel 邻近信道 | adjacent frequency 相邻频率

adjoining：邻接的

adjoin 邻接 | adjoining 邻接的 | adjoint 伴随矩阵

adjoint：伴随矩阵

adjoining 邻接的 | adjoint 伴随矩阵 | adjourn 延期

FLOYD：弗罗伊德

[摘要]最短路径分析是GIS网络分析的一个基本问题,获取最短路径的经典算法主要有迪杰斯特拉(Dijkstra)及弗罗伊德(floyd)算法,这两种方法的实现都主要借助于图的节点邻接矩阵来表示图并通过适当的搜索技术完成.

incidence matrix：关联矩阵

图的邻接矩阵是如下定义的:是一个的矩阵,即关联矩阵表示法是将图以关联矩阵(incidence matrix)的形式存储在计算机中.图的关联矩阵是如下定义的:是一个的矩阵,即弧表表示法将图以弧表(arc list)的形式存储在计算机中.

adjacency list structure：邻接表结构

NP困难问题 NP-hard problem | 邻接表结构 adjacency list structure | 邻接矩阵 adjacency matrix