1/15
Looks like no tags are added yet.
walk
sequence of edges from one vertex to another
Trail
walk no edges are repeated
circuit/cycle
start and end at same vertex
path
no repeated edges or vertices
Eulerian Graph
uses all edges on graph
Eulerian trail
uses all edges/no repeat edges
Eulerian circuit
start and end/all edges used
Eulerian only when
ALL VERTICES ARE EVEN
Semi-Eularan
only 2 vertices are odd and the others are even
Hamiltonian Graph
cycle that uses all vertices on graph
H. path
path that visits all vertices exactly once
H. cycle
visits every vertex exactly once and returns to start
float time
LST-EST-Duration
how to convert degree and ‘
x60 or /60
how to convert distance to time
/15
4min
1 degree