Thu Feb 14

Let's talk about graphs and trees ... and how to "traverse" them.

I've written some code which will take some explaining , which is in code/graphs/search .

Topics :

• trees with recursive depth-first search
• how to implement breadth-first ?
  • marking visited nodes
  • the "fringe" concept ... and a loop, not recursion
  • fringe with stack vs fringe with queue

The assignment for Tuesday is posted ...

aside

• StyleGAN
  • This person does not exist | hackernews discussion
  • StyleGAN — Official TensorFlow Implementation
  • Generating and Tuning Realistic Artificial Faces