decisions 1 keywords

出口

質問 1 of 1

  残り時間


0 [{"id":328452,"quiz_id":"16677","answer_id":null,"answerType_id":"2","created_at":"2017-11-28 16:06:27","updated_at":"2017-11-28 16:15:23","questionName":"Match the keywords to the definitions.","questionTimeSeconds":"0","questionTimeMinutes":"5","questionImagePath":null,"position":2,"explanation":"","question_score_id":null,"lang":null,"questionAudioPath":null},{"id":328456,"quiz_id":"16677","answer_id":null,"answerType_id":"0","created_at":"2017-11-28 16:11:21","updated_at":"2017-11-28 16:15:23","questionName":"Does contain: CONNECTED VERTICES. Does not contain: CYCLES.","questionTimeSeconds":"0","questionTimeMinutes":"2","questionImagePath":null,"position":4,"explanation":"","question_score_id":null,"lang":null,"questionAudioPath":null},{"id":328449,"quiz_id":"16677","answer_id":null,"answerType_id":"0","created_at":"2017-11-28 16:00:39","updated_at":"2017-11-28 16:15:23","questionName":"A tree is...","questionTimeSeconds":"0","questionTimeMinutes":"2","questionImagePath":null,"position":1,"explanation":"","question_score_id":null,"lang":null,"questionAudioPath":null},{"id":328446,"quiz_id":"16677","answer_id":null,"answerType_id":"1","created_at":"2017-11-28 15:56:35","updated_at":"2017-11-28 16:15:23","questionName":"A path is a _ _ of edges such that the end vertex of one edge is the start vertex of another, and no _ appears more than once.","questionTimeSeconds":"0","questionTimeMinutes":"2","questionImagePath":null,"position":3,"explanation":"","question_score_id":null,"lang":null,"questionAudioPath":null},{"id":328454,"quiz_id":"16677","answer_id":null,"answerType_id":"0","created_at":"2017-11-28 16:09:53","updated_at":"2017-11-28 16:15:23","questionName":"Does contain: EDGES, VERTICES. May contain: CYCLES. Does not contain: DIRECTIONS.","questionTimeSeconds":"0","questionTimeMinutes":"2","questionImagePath":null,"position":0,"explanation":"","question_score_id":null,"lang":null,"questionAudioPath":null}]
328452
0
300
block

Match the keywords to the definitions.

テキストをマッチさせる(クリックしてドラッグする)   

(0/0)




テキストにマッチ

Tree

Spanning Tree

Degree

Graph

Connected

Digraph

Subgraph

Path

Cycle

クリックしてドラッグ

A series of vertices connected by edges.

A subgraph which contains all the vertices of the larger graph and no cycles.

A connected graph with no cycles.

A pair of vertices incident to the same edge.

A graph, all of whose edges and vertices belong to a larger graph.

A closed sequence of finite edges.

The number of edges incident to a vertex.

A graph whose edges have direction.

A sequence of finite edges, where no vertex appears more than once.


328456
0
120
none
328449
0
120
none
328446
0
120
none
328454
0
120
none