西安航空学院学报2024,Vol.42Issue(3) :73-76.DOI:10.20096/j.xhxb.1008-9233.2024.03.011

含负权有向图最短路问题的新解法

A New Solution to Shortest Path Problem of Directed Graphs with Negative Weight

张鹏
西安航空学院学报2024,Vol.42Issue(3) :73-76.DOI:10.20096/j.xhxb.1008-9233.2024.03.011

含负权有向图最短路问题的新解法

A New Solution to Shortest Path Problem of Directed Graphs with Negative Weight

张鹏1
扫码查看

作者信息

  • 1. 西安航空学院经济管理学院,西安 710077
  • 折叠

摘要

通过简要分析现有含负权有向图最短路问题求解方法,基于Dijkstra算法图表法的基本原理,提出了一种新的较为直观的图表求解方法.该方法根据问题抽象所得的含负权有向图,通过确定权数来求解最短路问题,并给出了计算实例.结果表明,该方法具有实用性,且所提算法具有简便直观,计算量较少,不易出错,效率较高的特点.

Abstract

Based on the basic principle of Dijkstra algorithm diagram method,a new intuitive graph solving method is proposed.According to the abstract negative weighted directed graph obtained by the problem,the shortest circuit problem is solved by determining the weight,and a calculation example is given.The results show that the proposed method is practical,and the proposed algo-rithm has the characteristics of simplicity and intuitiveness,less calculation,less error-prone and high efficiency.

关键词

负权/有向图/最短路/图表法

Key words

negative weight/directed graph/shortest path/diagram method

引用本文复制引用

基金项目

陕西省教育信息化建设专项基金项目(21JX012)

出版年

2024
西安航空学院学报
西安航空技术高等专科学校

西安航空学院学报

影响因子:0.351
ISSN:1008-9233
参考文献量11
段落导航相关论文