Which marriages in the village will last? Which chicken is queen of the coop? How many crayons do you need to color a county map of Tennessee? What do all of these questions have in common? They’re all graph problems.
Graphs are simultaneously the most intuitive data structure and host to some of the most escoteric algorithms and properties most developers are likely to encounter. Come to this talk for a friendly and approachable introduction to graph theory, application, and implementation.
Tim Berglund is a teacher, author, and technology leader with DataStax. He has spoken at numerous conferences internationally and in the United States and contributes to the Denver tech community as president of the Denver Open Source User Group. He is the copresenter of various O’Reilly training videos on topics ranging from Git to Mac OS X productivity tips to Apache Cassandra and is the author of Gradle Beyond the Basics. Tim blogs very occasionally at timberglund.com. He lives in Littleton, Colorado, with the wife of his youth and their three children.
Comments on this page are now closed.
For exhibition and sponsorship opportunities, contact Sharon Cordesse at firstname.lastname@example.org
For information on trade opportunities with O'Reilly conferences contact email@example.com
For media-related inquiries, contact Maureen Jennings at firstname.lastname@example.org
View a complete list of OSCON contacts