Do you know how to tell if a directed graph is strongly connected? Do you know how to work with directed graphs?
This next Monday the Computer Programming Challenges group will expand on the discussion of graphs, and compare directed graphs to graphs. They'll discuss the problems they were working on throughout the week, and spend time looking/working on new problems.
Hope to see you there: Mondays 6:30pm Avery 347
Local programing contest Sept. 29
Regional programing contest Nov. 9
Contact Jeff Ifland if you have questions: jifland@cse.unl.edu