dijkstra算法修正
This commit is contained in:
FanLian
@@ -561,88 +561,77 @@ namespace Tnb.WarehouseMgr
|
||||
|
||||
private async Task<List<WmsPointH>> LocPathCalcAlgorithms(string pStartId, string pEndId, List<WmsRoad> roads)
|
||||
{
|
||||
var points = await _db.Queryable<WmsPointH>().ToListAsync();
|
||||
List<WmsPointH> results = new();
|
||||
Dictionary<string, bool> isVisited = roads.Select(x => x.startpoint_id).Distinct().ToDictionary(x => x, x => false);
|
||||
|
||||
List<string> pointIds = new();
|
||||
List<string> codes = new();
|
||||
Dp dp = new();
|
||||
dynamic obj = new ExpandoObject();
|
||||
obj.isArrivedEpoint = false;
|
||||
dp.DpFunc(roads, pointIds, isVisited, pStartId, pEndId, obj);
|
||||
foreach (var pid in pointIds)
|
||||
{
|
||||
var point = points.Find(x => x.id == pid);
|
||||
if (point != null)
|
||||
{
|
||||
results.Add(point);
|
||||
}
|
||||
}
|
||||
return results;
|
||||
|
||||
#region dijkstra
|
||||
#region dp
|
||||
//List<WmsPointH> results = new();
|
||||
//var points = await _db.Queryable<WmsPointH>().ToListAsync();
|
||||
//var startObj = points.Find(x => x.id == pStartId);
|
||||
//var endObj = points.Find(x => x.id == pEndId);
|
||||
//var sIndex = points.IndexOf(startObj);
|
||||
//var eIndex = points.IndexOf(endObj);
|
||||
//if (eIndex < sIndex)
|
||||
//Dictionary<string, bool> isVisited = roads.Select(x => x.startpoint_id).Distinct().ToDictionary(x => x, x => false);
|
||||
|
||||
//List<string> pointIds = new();
|
||||
//List<string> codes = new();
|
||||
//Dp dp = new();
|
||||
//dynamic obj = new ExpandoObject();
|
||||
//obj.isArrivedEpoint = false;
|
||||
//dp.DpFunc(roads, pointIds, isVisited, pStartId, pEndId, obj);
|
||||
//foreach (var pid in pointIds)
|
||||
//{
|
||||
// var tempIndex = sIndex;
|
||||
// sIndex = eIndex;
|
||||
// eIndex = tempIndex;
|
||||
// var temp = points[sIndex];
|
||||
// points[sIndex] = points[eIndex];
|
||||
// points[eIndex] = temp;
|
||||
//}
|
||||
|
||||
////MatchPoint(results, roads, shortestPathPoints, isVisited, pStartId, pEndId);
|
||||
|
||||
|
||||
//var vexs = points.Select(p => p.id).ToArray();
|
||||
//EData[] edges = new EData[roads.Count];
|
||||
//for (int i = 0; i < edges.Length; i++)
|
||||
//{
|
||||
// var start = roads[i].startpoint_id;
|
||||
// var end = roads[i].endpoint_id;
|
||||
// var weight = roads[i].distance;
|
||||
// edges[i] = new EData(start, end, weight);
|
||||
//}
|
||||
|
||||
|
||||
//Dijkstra pG = new(vexs, edges);
|
||||
//int[] prev = new int[pG.mVexs.Length];
|
||||
//int[] dist = new int[pG.mVexs.Length];
|
||||
//List<WmsPointH> vertexs = new() { startObj };
|
||||
//pG.CalcDijkstra(sIndex, prev, dist);
|
||||
//var pointIds = points.Select(p => p.id).ToList();
|
||||
//List<string> result = new();
|
||||
//GetPoints(pointIds, prev, result, eIndex);
|
||||
|
||||
//var items =new List<string>();
|
||||
//foreach (var item in prev.Where(x=>x!=0))
|
||||
//{
|
||||
// if (points[item] != null)
|
||||
// var point = points.Find(x => x.id == pid);
|
||||
// if (point != null)
|
||||
// {
|
||||
// items.Add(points[item].point_code);
|
||||
// results.Add(point);
|
||||
// }
|
||||
//}
|
||||
//var @strings = string.Join(",", items.OrderBy(o=>o));
|
||||
//return results;
|
||||
#endregion
|
||||
|
||||
//var shortestPathPoints = points.FindAll(x => result.Contains(x.id));
|
||||
//if (shortestPathPoints.IndexOf(startObj) < 0)
|
||||
//{
|
||||
// shortestPathPoints.Add(startObj);
|
||||
//}
|
||||
#region dijkstra
|
||||
var points = await _db.Queryable<WmsPointH>().ToListAsync();
|
||||
var startObj = points.Find(x => x.id == pStartId);
|
||||
var endObj = points.Find(x => x.id == pEndId);
|
||||
var sIndex = points.IndexOf(startObj);
|
||||
var eIndex = points.IndexOf(endObj);
|
||||
if (eIndex < sIndex)
|
||||
{
|
||||
var tempIndex = sIndex;
|
||||
sIndex = eIndex;
|
||||
eIndex = tempIndex;
|
||||
var temp = points[sIndex];
|
||||
points[sIndex] = points[eIndex];
|
||||
points[eIndex] = temp;
|
||||
}
|
||||
|
||||
//List<WmsPointH> results = new() { startObj };
|
||||
//var isVisited = shortestPathPoints.ToDictionary(x => x.id, x => false);
|
||||
//var isVisited2 = shortestPathPoints.ToDictionary(x => x.id, x => false);
|
||||
//isVisited[pStartId] = true;
|
||||
var vexs = points.Select(p => p.id).ToArray();
|
||||
EData[] edges = new EData[roads.Count];
|
||||
for (int i = 0; i < edges.Length; i++)
|
||||
{
|
||||
var start = roads[i].startpoint_id;
|
||||
var end = roads[i].endpoint_id;
|
||||
var weight = roads[i].distance;
|
||||
edges[i] = new EData(start, end, weight);
|
||||
}
|
||||
|
||||
//MatchPoint(results, roads, shortestPathPoints, isVisited, pStartId, pEndId);
|
||||
//results.Add(endObj);
|
||||
Dijkstra pG = new(vexs, edges);
|
||||
int[] prev = new int[pG.mVexs.Length];
|
||||
int[] dist = new int[pG.mVexs.Length];
|
||||
List<WmsPointH> vertexs = new() { startObj };
|
||||
pG.CalcDijkstra(sIndex, prev, dist);
|
||||
var pointIds = points.Select(p => p.id).ToList();
|
||||
Stack<string> result = new();
|
||||
GetPoints(pointIds, prev, result, eIndex);
|
||||
|
||||
List<WmsPointH> results = new() { startObj };
|
||||
if (points?.Count > 0)
|
||||
{
|
||||
foreach (var i in result)
|
||||
{
|
||||
WmsPointH? point = points?.Find(x => x.id == i);
|
||||
if (point != null)
|
||||
{
|
||||
results.Add(point);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return results;
|
||||
#endregion
|
||||
|
||||
}
|
||||
@@ -677,12 +666,12 @@ namespace Tnb.WarehouseMgr
|
||||
/// <param name="prev"></param>
|
||||
/// <param name="result"></param>
|
||||
/// <param name="eIdx"></param>
|
||||
private static void GetPoints(List<string> pointIds, int[] prev, List<string> result, int eIdx)
|
||||
private static void GetPoints(List<string> pointIds, int[] prev, Stack<string> result, int eIdx)
|
||||
{
|
||||
var index = eIdx;
|
||||
while (index != 0)
|
||||
{
|
||||
result.Add(pointIds[index]);
|
||||
result.Push(pointIds[index]);
|
||||
index = prev[index];
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user