D1 Flashcards
1
Q
Walk
A
A path where a vertex can be visited more then once
2
Q
Path
A
A sequence of connected edges where no vertex appears more then once
3
Q
Simple Graph
A
Graph with no loops or repeated edges
4
Q
Cycle
A
Path starting and finishing at the same vertex (closed path)
5
Q
Connected Graph
A
A graph where a route exists between every node
6
Q
Spanning Tree
A
A subgraph that is a tree and includes all vertices of the graph
7
Q
Tree
A
A simple connected graph with no cycles or loops
