Вавилов Виталий. Отчет. Алгоритм Беллмана-Форда. #15
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
skonnov
approved these changes
Dec 27, 2024
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Введение
Роль алгоритма в теории графов и его актуальность в решении современных задач
Постановка задачи и цель работы
Математичекская поставновка задачи и цель данной работы
Описание seq версии алгоритма
Описание двух методов последовательной реализации
Описание mpi версии алгоритма
Описание mpi реализации для crs графов
Анализ производительности
Тесты производительности с разными типами матриц на определенном железе
Список литературы
Необходимая литература
Заключение
Выводы
Фрагменты кода программы
Код с seq и mpi версиями алгоритма