Διαδρομές Euler και Hamilton
Interactive application to identify routes or circuits that pass through each vertex of the graph only once to reach (or to not reach) the initial vertex of the route.
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | 999 |
| Γλώσσα: | Greek |
| Έκδοση: |
2015
|
| Θέματα: | |
| Διαθέσιμο Online: | http://localhost:8080/jspui/handle/11419/451 |
| Περίληψη: | Interactive application to identify routes or circuits that pass through each vertex of the graph only once to reach (or to not reach) the initial vertex of the route. |
|---|
