摘要： 提出了基于关联矩阵求解网络连通性问题的基本原理,并且说明了该算法的快速技术和实现方法,该算法既可以通过汇编语言或高级语言编程实现,也可以由单片机系统或ASIC等硬件方法实现,特别适用于实时求解。

关键词: 网络连通性, 关联矩阵, 遍历

Abstract: In this paper , a fast algorithm for the solution of network connectivity is presented, which is based on incidence matrix.The method of making the algorithm fast and its implementation are studied The algorithm can be implemented by software and/or .hardware

中图分类号: 

• TP393.03