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.

Sign up for GitHub

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

feat: add cs solution to lc problem: No.2642 #1953

Merged
merged 4 commits into from
Nov 11, 2023
Merged

feat: add cs solution to lc problem: No.2642 #1953

Changes from 1 commit
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
886aa70
feat: add solution.cs to lc problems: No.2642
dev-mauli Nov 11, 2023
6d6382c
Update README_EN.md to lc problems: No.2642
dev-mauli Nov 11, 2023
dd054e7
Update README.md to lc problems: No.2642
dev-mauli Nov 11, 2023
a13033e
style: format code and docs with prettier
dev-mauli Nov 11, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
style: format code and docs with prettier
  • Loading branch information
@dev-mauli @idoocs
dev-mauli authored and idoocs committed Nov 11, 2023
commit a13033e463e3a29b4645d4bf336506236d27aa65
4 changes: 2 additions & 2 deletions solution/2600-2699/2642.Design Graph With Shortest Path Calculator/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -327,11 +327,11 @@ public class Graph {
g[e[0]][e[1]] = e[2];
}
}

public void AddEdge(int[] edge) {
g[edge[0]][edge[1]] = edge[2];
}

public int ShortestPath(int node1, int node2) {
int[] dist = new int[n];
bool[] vis = new bool[n];
Expand Down