Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/codemistic/Data-Structures-and-Algorithms
/ node
Class
node
CPP/graph_tree/Bellman-Ford-Algorithm.cpp:3–12 ·
view source on GitHub ↗
Source
from the content-addressed store, hash-verified
1
#include<bits/stdc++.h>
2
using namespace std;
3
struct node {
4
int u;
5
int v;
6
int wt;
7
node(int first, int second, int weight) {
8
u = first;
9
v = second;
10
wt = weight;
11
}
12
};
13
14
int main(){
15
int N=6,m=7;
Callers
1
main
Function · 0.70
Calls
no outgoing calls
Tested by
no test coverage detected