Day 18 of #SSNC facts! We're looking at the #SeymourConjecture: Does every #OrientedGraph have a node with a second neighborhood at least as large as its first? Can traditional #GraphTheory #Algorithms solve the neighborhood size challenge? Today, we examine #DepthFirstSearch (DFS). #Math
3
1
1
0