National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Navigation in Graph
Žák, Vojtěch ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
The representation of problems and systems is important. The more unificated representation we get, the more precise operations and solves we can write down and preserve. One of the mostly used representations of systems is graph. For graph there are defined ground rules as well as ground algorithms. This work is oriented on part of these algorithms. Specifically, algorithms for searching the state space. With the knowledge from these algorithms a new algorithm is assembled. An algorithm for finding the shortest paths over graph, representing the area of this faculty. The algorithm then applies the resulting application.
Navigation in Graph
Žák, Vojtěch ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
The representation of problems and systems is important. The more unificated representation we get, the more precise operations and solves we can write down and preserve. One of the mostly used representations of systems is graph. For graph there are defined ground rules as well as ground algorithms. This work is oriented on part of these algorithms. Specifically, algorithms for searching the state space. With the knowledge from these algorithms a new algorithm is assembled. An algorithm for finding the shortest paths over graph, representing the area of this faculty. The algorithm then applies the resulting application.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.