C# (CSharp) Graphs Node.Handler示例

示例#1

 private bool DFS(Node node)
 {
     node.Handler();
     if (node == goal)
     {
         return(true);
     }
     visited.Add(node);
     foreach (var child in node.Children.Where(x => !visited.Contains(x)))
     {
         if (DFS(child))
         {
             path.AddFirst(child);
             return(true);
         }
     }
     return(false);
 }

示例#2

文件： DepthFirstSearch.cs 项目： HaruAtari/blog-sources

 private bool DFS(Node node)
 {
     node.Handler();
     if (node == goal)
     {
         return true;
     }
     visited.Add(node);
     foreach (var child in node.Children.Where(x => !visited.Contains(x)))
     {
         if (DFS(child))
         {
             path.AddFirst(child);
             return true;
         }
     }
     return false;
 }

示例#3

 private bool DLS(Node node, int limit)
 {
     node.Handler();
     if (node == goal)
     {
         return(true);
     }
     if (limit == 0)
     {
         limitWasReached = false;
         return(false);
     }
     visited.Add(node);
     foreach (var child in node.Children.Where(x => !visited.Contains(x)))
     {
         if (DLS(child, limit - 1))
         {
             path.AddFirst(child);
             return(true);
         }
     }
     return(false);
 }

示例#4

文件： DepthFirstSearch.cs 项目： HaruAtari/blog-sources

 private bool DLS(Node node, int limit)
 {
     node.Handler();
     if (node == goal)
     {
         return true;
     }
     if (limit == 0)
     {
         limitWasReached = false;
         return false;
     }
     visited.Add(node);
     foreach (var child in node.Children.Where(x => !visited.Contains(x)))
     {
         if (DLS(child, limit - 1))
         {
             path.AddFirst(child);
             return true;
         }
     }
     return false;
 }