zila.techy
BAN USER- 1of 1 vote
AnswersWe define an undirected graph g,such that: The total number of nodes in the graph is g_nodes. The nodes are numbered sequentially as 1,2,3….g_nodes. The total number og edges in the graph is g_edges. Each edge connect two distinct nodes(i.e no edge connect a node to itself). The weight of the edge connecting nodes g_to[i] and g_from[i] is g_weight[i]. We define the weight of the path from some start node to some end node to the sum of all edges traversed on the path. Input formate: The first line contain two space-seperated integer describing the respective value of g_node and g_edge. Each line I of the g_edge subsequent lines contain three space –seperated integer describing the respective value of g_to[i],g_from[i] and g_weight[i]. The next line contain an integer denoting start The next line contain an integer denoting end. The next line contain an integer denoting w_extra. input 1:
- zila.techy in India
4 4
1 2 2
2 3 1
2 4 2
3 4 3
1
4
5
Output:4
input2:
5 5
1 2 2
1 4 4
2 3 1
3 4 3
4 5 1
1
4
2
output:3
Int mincost(int g_nodes,int g_edged,int* g_from,int* g_to,int* weight,int start,int end,int w_extra)
{
}| Report Duplicate | Flag | PURGE
Amazon Developer Program Engineer C
could u please code this question in c language.Actually i dont know c++ much...@ ChrisZ
- zila.techy October 22, 2016