Graph Theory Challenge

Froggy Jumps

Parties jouées 4

Créer une copie

À propos de cette activité

Test your graph theory skills.

Créé par

SHIVAM JAVALE

India

Téléchargez la version pour jouer sur papier

Top 10 résultats

Il n'y a toujours pas de résultats pour ce jeu. Soyez le premier à apparaître dans le classement! Connectez-vous pour vous identifier.

Créez votre propre jeu gratuite à partir de notre créateur de jeu

Affrontez vos amis pour voir qui obtient le meilleur score dans ce jeu

Créer un défi


Froggy Jumps Graph Theory ChallengeVersion en ligne Test your graph theory skills. par SHIVAM JAVALE 1 In a simple graph, what is the maximum possible degree of a vertex with n vertices? a n b n-1 c n/2 2 What is a path that visits every vertex exactly once called? a Eulerian path b Simple path c Hamiltonian path 3 What is a spanning tree? a A subgraph that is a tree including all vertices b A cycle that includes all vertices c A connected graph with no edges 4 For an undirected graph, when does an Euler circuit exist? a All vertices have even degree (and the graph is connected) b The graph is acyclic c At least one vertex has odd degree 5 What is a directed graph where every vertex can reach every other vertex called? a Acyclic b Weakly connected c Strongly connected 6 Which data structure stores graph connections as (node, list of neighbors)? a Adjacency matrix b Edge set c Adjacency list 7 What cycle uses every edge exactly once? a Hamiltonian cycle b Eulerian circuit c Spanning cycle 8 How many edges are needed to connect n vertices in a tree? a n b n-1 c n+1 9 Which algorithm computes shortest paths from a single source in a weighted graph without negative weights? a Kruskal's algorithm b Dijkstra's algorithm c Bellman-Ford 10 What graph property indicates a graph has a path between any pair of vertices (undirected)? a Connected b Acyclic c Planar

Froggy Jumps

Graph Theory ChallengeVersion en ligne

Test your graph theory skills.

par SHIVAM JAVALE

In a simple graph, what is the maximum possible degree of a vertex with n vertices?

n-1

n/2

What is a path that visits every vertex exactly once called?

Eulerian path

Simple path

Hamiltonian path

What is a spanning tree?

A subgraph that is a tree including all vertices

A cycle that includes all vertices

A connected graph with no edges

For an undirected graph, when does an Euler circuit exist?

All vertices have even degree (and the graph is connected)

The graph is acyclic

At least one vertex has odd degree

What is a directed graph where every vertex can reach every other vertex called?

Acyclic

Weakly connected

Strongly connected

Which data structure stores graph connections as (node, list of neighbors)?

Adjacency matrix

Edge set

Adjacency list

What cycle uses every edge exactly once?

Hamiltonian cycle

Eulerian circuit

Spanning cycle

How many edges are needed to connect n vertices in a tree?

n-1

n+1

Which algorithm computes shortest paths from a single source in a weighted graph without negative weights?

Kruskal's algorithm

Dijkstra's algorithm

Bellman-Ford

What graph property indicates a graph has a path between any pair of vertices (undirected)?

Connected

Acyclic

Planar

Vous pouvez intégrer le jeu dans un LMS compatible avec LTI 1.1 ou LTI 1.3 comme Canvas, Moodle ou Blackboard. Les scores seront ainsi automatiquement enregistrés dans le carnet de notes de la plateforme.

Graph Theory Challenge

Froggy Jumps

À propos de cette activité

Créé par

Téléchargez la version pour jouer sur papier

Top Jeux

Froggy Jumps

pizza

Froggy Jumps

Bill of Rights Game - The Constitutionalist

Froggy Jumps

The Integumentary System

Froggy Jumps

Ethos, Pathos, and Logos Quiz

Froggy Jumps

Phlebotomy Order of Draw Quiz

Froggy Jumps

Graph Theory ChallengeVersion en ligne

par SHIVAM JAVALE

In a simple graph, what is the maximum possible degree of a vertex with n vertices?

What is a path that visits every vertex exactly once called?

What is a spanning tree?

For an undirected graph, when does an Euler circuit exist?

What is a directed graph where every vertex can reach every other vertex called?

Which data structure stores graph connections as (node, list of neighbors)?

What cycle uses every edge exactly once?

How many edges are needed to connect n vertices in a tree?

Which algorithm computes shortest paths from a single source in a weighted graph without negative weights?

What graph property indicates a graph has a path between any pair of vertices (undirected)?

		%
	Anonyme	%
		%
		%