Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

added changes to your bellmanford.js#1861

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 ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Open
Ujwal200707 wants to merge1 commit intoTheAlgorithms:master
base:master
Choose a base branch
Loading
fromUjwal200707:master

Conversation

@Ujwal200707
Copy link

The change replaces the final loop with a direct return statement.
Previously, the code looped through all vertices to find the destination and then returned its distance. This loop was unnecessary because the destination index is already known.
By using:

return dis[dest]

the code becomes more efficient and readable.
It removes redundant iterations, reduces time complexity for that part from O(V) to O(1), and makes the function cleaner without affecting the output.

Sign up for freeto join this conversation on GitHub. Already have an account?Sign in to comment

Reviewers

@raklaptudirmraklaptudirmAwaiting requested review from raklaptudirmraklaptudirm is a code owner

@appgurueuappgurueuAwaiting requested review from appgurueuappgurueu is a code owner

At least 2 approving reviews are required to merge this pull request.

Assignees

No one assigned

Labels

None yet

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

1 participant

@Ujwal200707

[8]ページ先頭

©2009-2025 Movatter.jp