Bellman-Ford Algorithm (shortest path from source)?

Short answer: public class Edge { public int Source, Dest, Weight; public Edge(int s, int d, int w) { Source = s; Dest = d; Weight = w; } } int[] BellmanFord(int vertices, List<Edge> edges, int source) { int[] dist = new int[vertices]; for (int i = 0; i < vertices; i++) dist[i] = int.MaxValue; dist[source] = 0; Follow on: for (int i = 1; i < vertices; i++) { foreach (var edge in edges) { if (dist[edge.Source] != int.MaxValue &&…

Explain a bit more

dist[edge.Source] + edge.Weight < dist[edge.Dest]) { dist[edge.Dest] = dist[edge.Source] + edge.Weight; } } } // Detect negative weight cycle (optional) foreach (var edge in edges) { if (dist[edge.Source] != int.MaxValue && dist[edge.Source] + edge.Weight < dist[edge.Dest]) { throw new Exception("Graph contains negative weight cycle"); } } return dist; } Explanation: Relax edges V-1 times, then check for negative weight cycles.

Example code

public class Edge {
public int Source, Dest, Weight;
public Edge(int s, int d, int w) {
Source = s; Dest = d; Weight = w;
}
}
int[] BellmanFord(int vertices, List<Edge> edges, int source) {
int[] dist = new int[vertices];
for (int i = 0; i < vertices; i++) dist[i] = int.MaxValue;
dist[source] = 0; Follow on: for (int i = 1; i < vertices; i++) {
foreach (var edge in edges) {
if (dist[edge.Source] != int.MaxValue && dist[edge.Source] + edge.Weight < dist[edge.Dest]) { dist[edge.Dest] = dist[edge.Source] + edge.Weight;
}
}
} // Detect negative weight cycle (optional) foreach (var edge in edges) {
if (dist[edge.Source] != int.MaxValue && dist[edge.Source] + edge.Weight < dist[edge.Dest]) { throw new Exception("Graph contains negative weight cycle"); }
}
return dist;
} Explanation: Relax edges V-1 times, then check for negative weight cycles.

Real-world example (ShopNest)

In coding rounds, state complexity aloud, write a clear ShopNest-flavored example (orders, carts), then handle edge cases (empty list, null, overflow).

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.