Ashish Verma

Last seen: 約2年前 | 2021 年からアクティブ

Followers: 0 Following: 0

統計

ランク
35,708
of 297,922

評判
1

コントリビューション
6 質問
2 回答

回答採用率
50.0%

獲得投票数
1

バッジを表示

Feeds

質問

I am having an array with positive integers, and i want to know all the possibility that the sum of elements of the array is close to or equal to a number say (N))
I am having an array with positive integers, and i want to know all the possibility that the sum of elements of the array is cl...

約2年前 | 1 件の回答 | 1

1

回答

質問

How to find out TSP of a graph.
I have 5 points in a graph and need to find TSP s = [1 1 1 1 2 2 2 3 3 4 ] t= [ 2 3 4 5 3 4 5 4 5 5] ...

2年以上前 | 2 件の回答 | 0

2

回答

質問

How to find SingleNodeCycle and euler cycle cost of a complete graph
x = [1 1 1 2 2 3 ]; y = [ 2 3 4 3 4 4]; these are the co-ordinates of ...

2年以上前 | 1 件の回答 | 0

1

回答

質問

i have two different array holding some numbers, e.g; i have an array P containing 5 elements and other Q containing 6 elements. I want to find out P*Q matrix
Eg; P= [1 2 3 4 5 ]; Q=[8 9 5 7 3 4]; output like 1 2 3 4 5 8 1*8 2*8 ...

3年以上前 | 1 件の回答 | 0

1

回答

質問

I have a complete undirected graph with labeled edge. is there any toolbox to apply TSP in such graph.
% I have complete undirected graph G(V,E) with labeled edge. s= [1 1 1 1 1 1 1 1 2 2 2 2 2 ...

3年以上前 | 1 件の回答 | 0

1

回答

回答済み
How to make complete graph from co-ordinates.
Sir,i dont want to put any random weight. For example take two elements from x (0.3 , 5.6) and y(4.6 , 6.9) then distances bet...

3年以上前 | 0

回答済み
How to make complete graph from co-ordinates.
Sir, sorry for saying weight i must say distances between the points.

3年以上前 | 0

質問

How to make complete graph from co-ordinates.
x=[0.3 ,5.6 , -8.4,6.4 ] % These are my x-cordinates y=[4.6, 6.9,3.6,7.89]% These are my y-cordinates I want to plot complete ...

3年以上前 | 4 件の回答 | 0

4

回答