半直觉模糊图的路径研究  

Path of Half Intuitionistic Fuzzy Graph

作　　者：鱼先锋[1] 邢雪[1] 李超[1] 

机构地区：[1]商洛学院数学与计算机应用学院,商洛726000

出　　处：《计算机与数字工程》2017年第2期299-303,310,共6页Computer & Digital Engineering

基　　金：商洛学院科研项目(编号:15SKY001);陕西省教育厅专项科研计划项目(编号:16JK1236)资助

摘　　要：将对象视为顶点,用直觉模糊数刻画对象间的相关性和不相关性,作为直觉模糊边,建立了半直觉模糊图模型。给出了半直觉模糊图的路径、序关系等概念。定义了半直觉模糊图路径的限制可达度和整体可达度,用以刻画路径的拥塞情况。引入半直觉模糊图最强可达路径的概念。给出了求最强可达路径的算法,用以计算拥塞状况为主要限制因素下的最优路径。证明了算法的合理性并分析了算法的复杂度。给出了求最强可达路径的一个实例,结果显示求最强可达路径的算法合理高效且自动化程度高。Seen objects as vertex set,intuitionistic fuzzy number is used to depict the correlation and irrelevance between objects,which are defined as intuitionistic fuzzy edge.A half intuitionistic fuzzy graph model is built.The definations about path,and order relation of a half intuitionistic fuzzy graph are given.The limitative accessibility and gross accessibility of the path of a half intuitionistic fuzzy graph are defined.which are used to calculate the congestion situation of the path.The definition about strongest accessible path of a half intuitionistic fuzzy graph is introduced.The calculation algorithm of strongest accessible path is given.The algorithm can be used to calculate an optimum path when congestion is regarded as a main limiting factor.The rationality of the algorithm is proved and its complexity is analyzed.A example about calculating the strongest accessible path is given.The calculation result shows that the algorithm is reasonable and efficient and has a high degree of automation.

关 键 词：半直觉模糊图 路径可达度 最强可达路径 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]