From f25f89101a98ad815c0ae2d25e1a8dc35d53a5dd Mon Sep 17 00:00:00 2001
From: asmrobot <asmrobot@hotmail.com>
Date: Tue, 29 Oct 2019 13:55:37 +0000
Subject: [PATCH] format state machine
---
src/RichCreator.Utility/PathFinding/DijkstraFinding/Dijkstra.cs | 14 +++++++-------
1 files changed, 7 insertions(+), 7 deletions(-)
diff --git a/src/RichCreator.Utility/PathFinding/DijkstraFinding/Dijkstra.cs b/src/RichCreator.Utility/PathFinding/DijkstraFinding/Dijkstra.cs
index 084cb46..8ceb031 100644
--- a/src/RichCreator.Utility/PathFinding/DijkstraFinding/Dijkstra.cs
+++ b/src/RichCreator.Utility/PathFinding/DijkstraFinding/Dijkstra.cs
@@ -41,8 +41,8 @@
return new List<ZTPoint>();
}
- var s = nodes.Where(x => x.Name == start).ToList();
- var u = nodes.Where(x => x.Name != start).ToList();
+ var s = nodes.Where(x => x.Name.Equals(start)).ToList();
+ var u = nodes.Where(x => !x.Name.Equals( start)).ToList();
s.ForEach(x =>
{
@@ -103,11 +103,11 @@
private Edge GetEdgeByTwoNode(Node start, Node end)
{
- var edge = edges.FirstOrDefault(x => x.Start == start.Name && x.End == end.Name);
+ var edge = edges.FirstOrDefault(x => x.Start .Equals( start.Name) && x.End .Equals( end.Name));
if (edge == null)
{
- edge = edges.FirstOrDefault(x => x.Start == end.Name && x.End == start.Name);
+ edge = edges.FirstOrDefault(x => x.Start .Equals( end.Name) && x.End.Equals( start.Name));
}
return edge;
@@ -142,7 +142,7 @@
/// <returns></returns>
private Node GetNodeByName(ZTPoint nodeName)
{
- return nodes.FirstOrDefault(x => x.Name == nodeName);
+ return nodes.FirstOrDefault(x => x.Name.Equals(nodeName));
}
/// <summary>
@@ -152,7 +152,7 @@
{
edges.ForEach(edge =>
{
- if (nodes.All(x => x.Name != edge.Start))
+ if (nodes.All(x => !x.Name.Equals(edge.Start)))
{
nodes.Add(new Node()
{
@@ -160,7 +160,7 @@
});
}
- if (nodes.All(x => x.Name != edge.End))
+ if (nodes.All(x => !x.Name.Equals(edge.End)))
{
nodes.Add(new Node()
{
--
Gitblit v1.9.3