Beruflich Dokumente
Kultur Dokumente
MIT 6.042J/18.062J
A cycle is a closed walk
of length > 2 that doesn’t
cross itself:
Trees v
w
a
Albert R Meyer, April 8, 2013 tree-def.1 Albert R Meyer, April 8, 2013 tree-def.2
Albert R Meyer, April 8, 2013 tree-def.3 Albert R Meyer, April 8, 2013 tree-def.4
1
More Trees Come up all the time
• family trees
• search trees
• game trees
• parse trees
• spanning trees
Albert R Meyer, April 8, 2013 tree-def.5 Albert R Meyer, April 8, 2013 tree-def.6
2
Cut Edges Cut Edges
Albert R Meyer, April 8, 2013 tree-def.10 Albert R Meyer, April 8, 2013 tree-def.11
deleting e gives
e is a cut edge
two components
Albert R Meyer, April 8, 2013 tree-def.12 Albert R Meyer, April 8, 2013 tree-def.13
3
Cut Edges Cut Edges
Albert R Meyer, April 8, 2013 tree-def.16 Albert R Meyer, April 8, 2013 tree-def.17
4
alternative tree definition alternative tree definition
A tree is a connected graph A tree is a connected graph
with every edge a cut edge. that is edge-minimal.
equivalently equivalently
Albert R Meyer, April 8, 2013 tree-def.18 Albert R Meyer, April 8, 2013 tree-def.19
5
MIT OpenCourseWare
http://ocw.mit.edu
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .