-
Notifications
You must be signed in to change notification settings - Fork 1
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.
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
Solved 4 problems + Graphs #52
base: main
Are you sure you want to change the base?
Conversation
Solved problems: - Triangle of sticks - Colored cube - Anton and watermelons - Paid musical service Graphs: - Implemented Graph - Made Add/Remove functions for vertexes and edges.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Четвертая задача не изменена, так и не проходит по времени некоторые тесты
Не понял, какой смысл сейчас загружать графы, если там пока ничего не сделано нового
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Использование векторов - кринге
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Не проходит временное ограничение. Временная сложность большая
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Так а где дз?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Метод поиска пути не работает. Часть ошибок я описал
Чтобы понять, что все работает, загрузи мой коммит и тестируй на нем.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Тут ведь ошибки есть. Не нужно возвращать вершины, их достаточно возвращать
MinDist должнен быть приватным методом, если не должно использоваться вне метода поиска пути
Почему _edges
превратились в матрицу? Это список ребер, а не матрица
Часть я не разобрал, но я думаю, что и так будет норм
Пример использования графа
- Fully made Dijkstra's algorithm - Started making DFS algorithm
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
В имплементации графа есть лишние предметы + не доделан метод remove_edge
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Убери лишние детали - dfs здесь не нужен, нужен только алгоритм дейкстры
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
А еще remove_edge
так и не доделан
Solved problems: