# hw26 - Pablo Blanco
# NOT OK to post

# 1. Project progress:
# - implemented a proc that makes DFS spanning forest (and another for trees)
# - implemented a proc that constructs a "random" k-edge connected graph (for testing)
# - some progress in implementing a procedure that finds augmented paths
# - paper progress

# 2. Princeton Cemetery RSVP: Yes !

# 3. Number of unlabeled graphs on 13 vertices: 50502031367952

# 4. Number of unlabeled graphs on 13 vertices with 30 edges: 584089835857  

# 5. 
# n vtcs, n-1 edges: A001433
# n vtcs, n edges: A001434
# n vtcs, n+1 edges: A048179