Skip to content

Теория #13

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
sibenshtern wants to merge 7 commits into
base: main
Choose a base branch
from
Open

Теория #13

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
7ede2b0
Finish first part of theory
sibenshtern Jan 7, 2024
222b6e2
Finish second part of theory
sibenshtern Jan 7, 2024
a5a28c7
finish third part of theory
sibenshtern Jan 7, 2024
c50cad0
finish theory
sibenshtern Jan 7, 2024
f824966
update theory
sibenshtern Jan 7, 2024
7820c7d
update theory and upload pdf file
sibenshtern Jan 14, 2024
562622d
change some errors in markdown
sibenshtern Jan 14, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion doc/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# Теория по алгоритмам:

## 1. Обходы гррафа
## 1. Обходы графа
### 1.1. Ориентированный граф, псевдограф. Неориентированный граф, псевдограф. Связность в неор. графе, компоненты связности. Слабая и сильная связность в ор. графе. Компоненты слабой, сильной связности.
### 1.2. Обход в глубину. Цвета вершин. Времена входа и выхода. Лемма о белых путях(с доказательством).
### 1.3. Проверка связности неориентированного графа. Поиск цикла в неориентированном и ориентированном графе. Топологическая сортировка.
Expand Down
Loading