Advertisement
Guest User

Untitled

a guest
Mar 28th, 2017
44
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.31 KB | None | 0 0
  1. public State Search(string startNodeName, string endNodeName)
  2. {
  3. Node startNode = Program.instance.graph[startNodeName];
  4. Node endNode = Program.instance.graph[endNodeName];
  5.  
  6. List<State> stanjaZaObradu = new List<State>();
  7.  
  8. stanjaZaObradu.Add(new State(startNode));
  9.  
  10. for (int i = 0; i < MaxLevel; i++)
  11. {
  12. while (stanjaZaObradu.Count > 0)
  13. {
  14. State naObradi = stanjaZaObradu[0];
  15. stanjaZaObradu.Remove(naObradi);
  16.  
  17. if (naObradi.Node.Name == endNode.Name)
  18. {
  19. return naObradi;
  20. }
  21. else
  22. {
  23. List<State> mogucaSledecaStanja = naObradi.children();
  24. Console.WriteLine(mogucaSledecaStanja.Count);
  25. foreach (var stanje in mogucaSledecaStanja)
  26. {
  27.  
  28. if (i <= stanje.Level)
  29. {
  30. stanjaZaObradu.Insert(0, stanje);
  31. }
  32.  
  33. }
  34. }
  35. }
  36. }
  37. return null;
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement