基于图论的Dijkstra算法C#窗体应用程序实现
1.前言
算法实现参照博客https://blog.csdn.net/xv740234390/article/details/45152735，对此表示感谢！本文在此算法基础上根据自己论文，改进而来，特此说明。本文所用工具为：VS2017 .NetFrameWork4.6.1平台单线程+Access数据库。
数据库构建情况如下图所示：
论文路网情况如下图所示：
2.代码展示
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Data.OleDb;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace ShortestPath
{
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
}
private void Form1_Load(object sender, EventArgs e)
{
/*
*
*凡有注释“论文中参数--可舍去”的字段，均可删去，注意的是若删去某一字段，需得删除在其他地方的调用！！！
*
*/
connection();
readstation();
//以下步骤，可删除，但删除之后DataGridView中无数据源，需结合数据库Database1自行修改
DataTable dt = new DataTable();
BindingSource mbs = new BindingSource();
dt.Columns.Add("NodeID", typeof(int));
dt.Columns.Add("CurrentNode", typeof(string));
dt.Columns.Add("NextNode", typeof(string));
dt.Columns.Add("Distance", typeof(string));
string _station = "";
string _distance = "";
for (int i = 0; i < tu.Count; i++)
{
_station = "";
_distance = "";
for (int j = 0; j < tu[i].next_station.Count; j++)
{
_station += tu[i].next_station[j].ToString() + " ";
}
for (int j = 0; j < tu[i].distance_list.Count; j++)
{
_distance += tu[i].distance_list[j].ToString() + " ";
}
dt.Rows.Add(tu[i].station_id, tu[i].station_name, _station, _distance);
}
mbs.DataSource = dt;
grd.DataSource = mbs;
}
double belta = 0.001;//论文中参数--可舍去
double lamda = 2;//论文中参数--可舍去
double[][] alpha;//论文中参数--可舍去
double vex = 85;//论文中参数--可舍去
double[] kesi = new double[] { 1, 0.8, 0.3 };//论文中参数--可舍去
private OleDbConnection dbconn; //数据库连接
private static List<station> tu = new List<station>();//站点链表
/// Pp = new List
();
List<station> S = new List<station>();
T tt = new T();
int k = o;
station aa = new station();
tu.ElementAt(o).P = 0;
S.Add(tu.ElementAt(o));
while (S.Count < tu.Count)
{
for (int i = 0; i < tu.ElementAt(k).next_station.Count; i++)
{
int j = 0;
j = tu.ElementAt(k).next_station.ElementAt(i) - 1;//取出下一个车站的ID
if (tu.ElementAt(k).distance_list.ElementAt(i) == 0)
{
return S;
}
if (tu.ElementAt(j).T > tu.ElementAt(k).P + tu.ElementAt(k).distance_list.ElementAt(i))
{
for (int l = 0; l < Top.Count; l++)
{
if (Top.ElementAt(l).Distance_id == tu.ElementAt(j).station_id)
{
Top.RemoveAt(l);
}
}
tu.ElementAt(j).T = tu.ElementAt(k).P + tu.ElementAt(k).distance_list.ElementAt(i);
tu.ElementAt(j).f = k;
Top.Add(new T((tu.ElementAt(j).station_id), tt.value = tu.ElementAt(j).T));
}
}
Top.Sort(new Icp());//对Top中的元素进行排序
tu.ElementAt(Top.ElementAt(0).Distance_id - 1).P = Top.ElementAt(0).value;
S.Add(tu.ElementAt(Top.ElementAt(0).Distance_id - 1));
k = Top.ElementAt(0).Distance_id - 1;
Top.RemoveAt(0);
}
return S;
}
/// 3.运行结果
