摘要
在离散数学中利用邻接矩阵运算求取任意两点间路长为l的路数量的基础上,提出基于字符串连接的邻接矩阵运算规则,该方案直观有效地给出方案数并详细表述各方案的生成过程。为课堂教学效果的提高给出了重要指导。
On the basis of calculating the number of length paths between any two points in discrete mathematics,an adjacency matrix algorithm based on string connection is proposed.The scheme gives the number of schemes intuitively and effectively and describes the generation process of each scheme in detail.It gives important guidance for the improvement of classroom teaching effect.
作者
曾旭
王晓华
ZENG Xu;WANG Xiao-hua(College of Information Engineering Zunyi Medical University,Guizhou Zunyi 563003,China)
出处
《贵阳学院学报（自然科学版）》
2019年第3期1-3,共3页
Journal of Guiyang University：Natural Sciences
基金
国家自然科学基金项目:“基于多色集合理论的医院间电子病历访问模型研究”(项目编号:61861047)
关键词
离散数学
邻接矩阵
字符串连接路
Discrete Mathematical
Adjacency Matrix
String Connection
Path
