could you help me with c++ program (Implement Bellman-Ford Algorithm)

Given a directed graph G of five nodes, you are required to compute the shortest path between each pair of nodes using Bellman-Ford. Your output should be a 5x5 2-D array Dist which contains all the pairwise distances, i.e., Dist[i, j] should be the distance from node i to node j.

\f