static void Main(string[] args)
{
var n01 = new Node("01");
var n02 = new Node("02");
var n03 = new Node("03");
var n04 = new Node("04");
var n05 = new Node("05");
var n06 = new Node("06");
var n07 = new Node("07");
var n08 = new Node("08");
var n09 = new Node("09");
var n10 = new Node("10");
var n11 = new Node("11");
var n12 = new Node("12");
var n13 = new Node("13");
var n14 = new Node("14");
var n15 = new Node("15");
n01.AddChildren(n02).AddChildren(n03);
n02.AddChildren(n05);
n03.AddChildren(n04);
n04.AddChildren(n05, false).AddChildren(n10, false).AddChildren(n11, false);
n06.AddChildren(n01, false);
n07.AddChildren(n03, false).AddChildren(n08);
n09.AddChildren(n08).AddChildren(n10);
n11.AddChildren(n12).AddChildren(n13);
n12.AddChildren(n13);
n14.AddChildren(n15);
var search = new DepthFirstSearch();
var path = search.DLS(n06, n13, 6);
PrintPath(path);
}
static void Main(string[] args)
{
var n01 = new Node("01");
var n02 = new Node("02");
var n03 = new Node("03");
var n04 = new Node("04");
var n05 = new Node("05");
var n06 = new Node("06");
var n07 = new Node("07");
var n08 = new Node("08");
var n09 = new Node("09");
var n10 = new Node("10");
var n11 = new Node("11");
var n12 = new Node("12");
var n13 = new Node("13");
var n14 = new Node("14");
var n15 = new Node("15");
n01.AddChildren(n02).AddChildren(n03);
n02.AddChildren(n05);
n03.AddChildren(n04);
n04.AddChildren(n05, false).AddChildren(n10, false).AddChildren(n11, false);
n06.AddChildren(n01, false);
n07.AddChildren(n03, false).AddChildren(n08);
n09.AddChildren(n08).AddChildren(n10);
n11.AddChildren(n12).AddChildren(n13);
n12.AddChildren(n13);
n14.AddChildren(n15);
var search = new DepthFirstSearch();
var path = search.DLS(n06, n13,6);
PrintPath(path);
}
public bool FindMaximumFlowWithDFSRealization(Node Start, Node Target)
{
if (Start.Equals(Target))
{
CapacityOfFlow = 0.0;
return(true);
}
Node CurrentNode = new Node();
for (; DepthFirstSearch.DepthFirstSearch(Start, Target, FoundPath);)
{
double CurrentStreamCapacity = Infinity;
for (int Index = Target.Index; Index != Start.Index; Index = FoundPath[Index].Index)
{
CurrentNode = FoundPath[Index];
CurrentStreamCapacity = Min(CurrentStreamCapacity, InnerGraph.FindEdge(CurrentNode, InnerGraph.SetOfNodes[Index]).Weight);
}
for (int Index = Target.Index; Index != Start.Index; Index = FoundPath[Index].Index)
{
InnerGraph.FindEdge(CurrentNode, InnerGraph.SetOfNodes[Index]).Weight -= CurrentStreamCapacity;
InnerGraph.FindEdge(InnerGraph.SetOfNodes[Index], CurrentNode).Weight += CurrentStreamCapacity;
}
CapacityOfFlow += CurrentStreamCapacity;
DepthFirstSearch = new DepthFirstSearchAlgorithm(InnerGraph);
}
return(true);
}