![]() |
.. (לתיקייה המכילה) | |
Does the function have to find the shortest path or will any path do? | |
The function should find any path leading from S to E, not necessarily the shortest. |
02340118 - Computer Organization And Programming (ATAM) | ||||
אביב 2010-2011Spring 2010-2011Весна 2010-2011ربيع 2010-2011 | ||||
![]() |
.. (לתיקייה המכילה) | |
Does the function have to find the shortest path or will any path do? | |
The function should find any path leading from S to E, not necessarily the shortest. |