courses:algorithms_building_and_analysis:materials:start
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
courses:algorithms_building_and_analysis:materials:start [2022/04/19 12:31] kalishenko |
courses:algorithms_building_and_analysis:materials:start [2024/05/01 19:24] (current) kalishenko |
||
|---|---|---|---|
| Line 14: | Line 14: | ||
| ==== Графы ==== | ==== Графы ==== | ||
| - | === Кратчайшие пути === | ||
| - | * [[shortest_ways|Алгоритмы Дейкстра и Флойда-Уоршелла]] | ||
| - | * [[a_star_ways|Алгоритм А*]] | ||
| - | |||
| === Раскраска графов === | === Раскраска графов === | ||
| * [[graph_coloring_notes]] | * [[graph_coloring_notes]] | ||
| Line 24: | Line 20: | ||
| * [[http://www.lighterra.com/papers/graphcoloring/|Раскраска в компиляторах]] | * [[http://www.lighterra.com/papers/graphcoloring/|Раскраска в компиляторах]] | ||
| - | === Компоненты связности === | + | === Кратчайшие пути. A* === |
| - | * [[https://stepik.org/course/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC%D1%8B-%D0%B8-%D1%81%D1%82%D1%80%D1%83%D0%BA%D1%82%D1%83%D1%80%D1%8B-%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85-63/syllabus| 5 лекция Stepik]] | + | * [[https://youtu.be/uefAPI0xwfg?si=7-Yzq8RuHmaSoWSC|Лекция ШАД]] |
| + | * [[shortest_ways|Алгоритмы Дейкстра и Флойда-Уоршелла]] | ||
| + | * [[a_star_ways|Алгоритм А*]] | ||
| - | === Эвристические алгоритмы на графах === | + | === Кратчайшие пути. Расширения A* === |
| - | * {{ :courses:algorithms_building_and_analysis:a-star.pdf | Краткий констпект А*}} | + | |
| - | * {{ :courses:algorithms_building_and_analysis:a-star-source.pdf | Псевдокод А*}} | + | |
| * {{ :courses:algorithms_building_and_analysis:materials:midas-werneck.pdf | Подходы к применению A* в ГИС}} | * {{ :courses:algorithms_building_and_analysis:materials:midas-werneck.pdf | Подходы к применению A* в ГИС}} | ||
| + | |||
| + | === Компоненты связности === | ||
| + | * [[https://stepik.org/course/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC%D1%8B-%D0%B8-%D1%81%D1%82%D1%80%D1%83%D0%BA%D1%82%D1%83%D1%80%D1%8B-%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85-63/syllabus| 5 лекция Stepik]] | ||
| === Паросочетания === | === Паросочетания === | ||
| Line 44: | Line 43: | ||
| * [[https://neerc.ifmo.ru/wiki/index.php?title=%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_%D0%9A%D0%B0%D1%80%D0%B3%D0%B5%D1%80%D0%B0_%D0%B4%D0%BB%D1%8F_%D0%BD%D0%B0%D1%85%D0%BE%D0%B6%D0%B4%D0%B5%D0%BD%D0%B8%D1%8F_%D0%BC%D0%B8%D0%BD%D0%B8%D0%BC%D0%B0%D0%BB%D1%8C%D0%BD%D0%BE%D0%B3%D0%BE_%D1%80%D0%B0%D0%B7%D1%80%D0%B5%D0%B7%D0%B0|Конспект ИТМО (Каргер-Штейн, оценка сложности для обеспечения вероятности 1/n)]] | * [[https://neerc.ifmo.ru/wiki/index.php?title=%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_%D0%9A%D0%B0%D1%80%D0%B3%D0%B5%D1%80%D0%B0_%D0%B4%D0%BB%D1%8F_%D0%BD%D0%B0%D1%85%D0%BE%D0%B6%D0%B4%D0%B5%D0%BD%D0%B8%D1%8F_%D0%BC%D0%B8%D0%BD%D0%B8%D0%BC%D0%B0%D0%BB%D1%8C%D0%BD%D0%BE%D0%B3%D0%BE_%D1%80%D0%B0%D0%B7%D1%80%D0%B5%D0%B7%D0%B0|Конспект ИТМО (Каргер-Штейн, оценка сложности для обеспечения вероятности 1/n)]] | ||
| * {{ :courses:algorithms_building_and_analysis:min-cut-itmo.pdf | Методичка ИТМО}} | * {{ :courses:algorithms_building_and_analysis:min-cut-itmo.pdf | Методичка ИТМО}} | ||
| + | |||
| + | === Задача о коммивояжёре === | ||
| + | * [[https://compsciclub.ru/courses/tsp/2017-autumn/|CS club лекции]] | ||
| + | |||
| + | === Изоморфизм графов === | ||
| + | * [[https://adriann.github.io/Ullman%20subgraph%20isomorphism.html|Краткое изложение алгоритма Ульмана]] | ||
| ==== Строки ==== | ==== Строки ==== | ||
| Line 61: | Line 66: | ||
| === Точный поиск набора образцов. Алгоритм Ахо-Корасик === | === Точный поиск набора образцов. Алгоритм Ахо-Корасик === | ||
| + | * [[https://youtu.be/-KCd8UUwU38|Лекция Павла Маврина]] | ||
| * [[https://www.youtube.com/watch?v=pX4VCKudwYo|Лекция М.Дворкина в CS-центре]] | * [[https://www.youtube.com/watch?v=pX4VCKudwYo|Лекция М.Дворкина в CS-центре]] | ||
| * [[https://cr.yp.to/bib/1975/aho.pdf|Оригинальная статья "Alfred V. Aho, Margaret J. Corasick. Efficient string matching: Anaid to bibliographic search"]] | * [[https://cr.yp.to/bib/1975/aho.pdf|Оригинальная статья "Alfred V. Aho, Margaret J. Corasick. Efficient string matching: Anaid to bibliographic search"]] | ||
courses/algorithms_building_and_analysis/materials/start.1650371498.txt.gz · Last modified: 2022/12/10 09:08 (external edit)
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
