New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Joc: Kruskal și Prim în grafuri ponderate

Fill in the Blanks

Played 0

About this activity

Algoritmi pentru arborele minim

Created by

Romania

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Joc: Kruskal și Prim în grafuri ponderate
 

Fill in the Blanks

Joc: Kruskal și Prim în grafuri ponderateOnline version

Algoritmi pentru arborele minim

by matei
1

algorithm and algorithm solve the problem for : finding a cost tree . Kruskal starts with all nodes separated and adds the edges that do not create , repeating all nodes are connected . Prim starts at a node and gradually adds the cheapest edge that connects a node the current tree to an external node , until a minimum cost tree is obtained . Both results are efficient solutions for networks with different costs .

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.