private static void UpdateGraph(int maxFlow, Map <string, NetNode> pathTree, string endNode)
{
string currentName = endNode;
NetNode currentNode;
while ((currentNode = pathTree.Find(currentName).Data) != null)
{
NetEdge edge = GetEdgeByName(currentNode, currentName);
edge.Size += maxFlow;
edge.PreviousEdge.Size -= maxFlow;
currentName = currentNode.Name;
}
}
private static int GetFlow(Map <string, NetNode> pathTree, string endNode)
{
string currentName = endNode;
int maxFlow = int.MaxValue;
NetNode currentNode;
while ((currentNode = pathTree.Find(currentName).Data) != null)
{
NetEdge edge = GetEdgeByName(currentNode, currentName);
maxFlow = Math.Min(edge.Capacity - edge.Size, maxFlow);
currentName = currentNode.Name;
}
return(maxFlow);
}
private static void AddCity(string line, Map <string, NetNode> RBTree)
{
string[] parameters = line.Split(' ', StringSplitOptions.RemoveEmptyEntries);
if (parameters.Length != 3)
{
throw new Exception("Uncorrect data!!!");
}
string weight = parameters[2];
int capacity = int.Parse(weight);
string nodeName1 = parameters[0];
string nodeName2 = parameters[1];
NetNode node1, node2;
try
{
node1 = RBTree.Find(nodeName1).Data;
}
catch
{
node1 = new NetNode()
{
Name = nodeName1, Edges = new List <NetEdge>()
};
RBTree.Insert(nodeName1, node1);
}
try
{
node2 = RBTree.Find(nodeName2).Data;
}
catch
{
node2 = new NetNode()
{
Name = nodeName2, Edges = new List <NetEdge>()
};
RBTree.Insert(nodeName2, node2);
}
NetEdge city1ToCity2 = new NetEdge {
Capacity = capacity, To = node2
};
NetEdge city2ToCity1 = new NetEdge {
Capacity = capacity, To = node1
};
city2ToCity1.PreviousEdge = city1ToCity2;
city1ToCity2.PreviousEdge = city2ToCity1;
node1.Edges.Add(city1ToCity2);
node2.Edges.Add(city2ToCity1);
}
