public GraphVertexInfo(GraphVertex vertex)
{
Vertex = vertex;
IsUnvisited = true;
EdgesWeightSum = int.MaxValue;
PreviousVertex = null;
}
GraphVertexInfo GetVertexInfo(GraphVertex v)
{
foreach (var i in infos)
{
if (i.Vertex.Equals(v))
{
return(i);
}
}
return(null);
}
List <Vector2Int> GetPath(GraphVertex startVertex, GraphVertex endVertex)
{
var path = new List <Vector2Int>();
path.Add(endVertex.Value);
while (startVertex != endVertex)
{
endVertex = GetVertexInfo(endVertex).PreviousVertex;
if (endVertex == null)
{
return(null);
}
path.Add(endVertex.Value);
}
return(path);
}
public List <Vector2Int> FindShortestPath(GraphVertex startVertex, GraphVertex finishVertex)
{
InitInfo();
var first = GetVertexInfo(startVertex);
first.EdgesWeightSum = 0;
while (true)
{
var current = FindUnvisitedVertexWithMinSum();
if (current == null)
{
break;
}
SetSumToNextVertex(current);
}
return(GetPath(startVertex, finishVertex));
}
public void AddEdge(GraphVertex vertex, int edgeWeight)
{
AddEdge(new GraphEdge(vertex, edgeWeight));
}
public void RemoveEdge(GraphVertex vertex)
{
Edges.RemoveAll(x => x.ConnectedVertex == vertex);
}
public GraphEdge(GraphVertex connectedVertex, int weight)
{
ConnectedVertex = connectedVertex;
EdgeWeight = weight;
}
