public static void findPaths(string wordFirth, string wordSecond)
{
var nodeStart = NodesFabric.getInstance().find(wordFirth);//.GetHashCode()];
var nodeEnd = NodesFabric.getInstance().find(wordSecond);//.GetHashCode()];
if (nodeStart == null || nodeEnd == null)
throw new Exception("Ошибочка в поиске");
var tmpPath = new Path();
var removePath = new Path();
start(ref nodeStart, nodeStart, ref nodeEnd, tmpPath );
}
// recursive path
public static void start(ref Node startNode, Node current, ref Node end, Path tmpPath)
{
tmpPath.Add(current);
current.isVisited = true;
bool stepBack = false;
if (current != end)
{
for(int i = current.visitedCounter; i < current.relations.Count ; i++)
{
current.visitedCounter++;
if ( !current.relations[i].leftNode.isVisited )
{
start(ref startNode, current.relations[i].leftNode, ref end, tmpPath);
return;
}
else if ( !current.relations[i].rightNode.isVisited)
{
start(ref startNode, current.relations[i].rightNode, ref end, tmpPath);
return;
}// pass
}
// trace( "\nТупик: ", current.ToString() );
if ( current.visitedCounter == current.relations.Count && current == startNode)
{
stepBack = false;
} else
{
stepBack = true;
}
}
else
{
trace("\n", tmpPath);
stepBack = true;
}
if ( stepBack )
{
Node newStartNode = null;
if ( tmpPath.nodes.Count >= 2 )
{
tmpPath.nodes.RemoveAt(tmpPath.nodes.Count - 1);
current.visitedCounter = 0;
current.isVisited = false;
newStartNode = tmpPath.nodes.Last();
} else
{
newStartNode = current;
}
tmpPath.nodes.RemoveAt(tmpPath.nodes.Count - 1);// because than added in start
start(ref startNode, newStartNode, ref end, tmpPath);
return;
}// pass
}