Theoretical Computer Science, Cheat Sheet

Theoretical Computer Science, Cheat Sheet.

Фрагмент из книги:
The reasonable man adapts himself to the world; the unreasonable persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable.




Graph Theory.
Definitions:
Loop - An edge connecting a vertex to itself.
Directed - Each edge has a direction.
Simple - Graph with no loops or multi-edges.
Walk - A sequence v0e1v1...elvl.
Trail - A walk with distinct edges.
Path - A trail with distinct vertices.
Connected - A graph where there exists a path between any two vertices.
Component - A maximal connected subgraph.
Tree - A connected acyclic graph.
Free - tree A tree with no root.
DAG - Directed acyclic graph.
Eulerian - Graph with a trail visiting each edge exactly once.
Hamiltonian - Graph with a cycle visiting each vertex exactly once.
Cut - A set of edges whose removal increases the number of components.



Бесплатно скачать электронную книгу в удобном формате, смотреть и читать:
Скачать книгу Theoretical Computer Science, Cheat Sheet - fileskachat.com, быстрое и бесплатное скачивание.

Скачать pdf
Ниже можно купить эту книгу по лучшей цене со скидкой с доставкой по всей России.Купить эту книгу


Скачать - pdf - Яндекс.Диск.




Теги: учебник по информатике :: информатика