Skip to content
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

给邻接表的图实现添加一个边是否存在的判定 #1407

Closed
wants to merge 1 commit into from

Conversation

Rickxiaoxin
Copy link

在rust的邻接表实现图的程序中,对于添加边(或删除边)缺少了确认边存在(或不存在)。这会导致如果出现边存在的情况下添加边导致列表中存在重复的边。
截图 2024-06-29 00-45-26
添加一个判定后可避免该结果的产生

@krahets
Copy link
Owner

krahets commented Jul 26, 2024

Thanks for the PR! In this graph, we do not limit the number of edges between two vertices.

@krahets krahets closed this Jul 26, 2024
@Rickxiaoxin
Copy link
Author

Thank you very much for reading and responding. This is my first PR, and it may not fully comply with the process. I apologize for any inconvenience this may have caused you!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants