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:

Quiz de Grafos en Programación

Yes or No

Played 16

About this activity

Grafos y algoritmos en programación

Created by

Mexico

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
Quiz de Grafos en Programación
 

Quiz de Grafos en ProgramaciónOnline version

Grafos y algoritmos en programación

by MARÍA CRISTINA MARTÍNEZ CRUZ
1

Un grafo simple admite múltiples aristas entre los mismos dos vértices.

2

Un grafo consiste en vértices y aristas.

3

Un camino es una secuencia de aristas que conecta vértices.

4

Una lista de adyacencia consiste en que para cada nodo se guarda una lista de sus vecinos

5

En un grafo no dirigido, las aristas pueden ser dirigidas.

6

BFS solo funciona en grafos no ponderados.

7

Las aristas pueden ser dirigidas o no dirigidas.

8

Un grafo puede ser dirigido o no dirigido, y puede ser ponderado o no ponderado.

9

DFS busca en grafos recorriendo completamente una rama primero y después regresa a revisar las demás

10

Un grafo tiene siempre una ruta entre cualquier par de vértices.

Are you sure you want to leave the page?

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