Annulleret

Parallel Prim's Algorithm

I need you to create single windows form c# project to solve a problem using two ways each one have separate button at that form

1- solve it using prim's algorithm no parallel processing.

1- solve it using prim's algorithm with parallel processing.

use ten graph sizes as input i can select from them the sizes is (5,10,15,20,25,30,35,40,45,50 vertex)

each input graph vertex have more the one edge. find good sample testing data and save them inside the code..

the output is the time to create minimum spanning tree. use Stopwatch function.

the output showed in single text box.

GUI design is attached.

Færdigheder: .NET, C# Programmering

Se mere: use algorithm, tree in algorithm, tree graph, tree and graph, the algorithm is, sample graph data, problem graph, problem algorithm, prim no, parallel programming in c, net algorithm, graph to tree, graph sample data, graph s, graph problem, graph in algorithm, graph edge, graph c sharp, graph and tree, graph algorithm in c, good algorithm, find-s algorithm in c, edge graph, data algorithm, c programming find output

Om arbejdsgiveren:
( 36 bedømmelser ) Patiala, India

Projekt-ID: #5989427