Thursday, March 11, 2004
More Data Structure Goodness
Scott Mitchell is back on MSDN with Part 5 of the Extensive Examination of Data Structures. In this latest installment he covers Graphs, which are really a more general form of a tree.
In this fifth installment of the article series we're going to examine graphs. Graphs are composed of a set of nodes and edges, just like trees, but with graphs there are no rules for the connections between nodes. With graphs, there is no concept of a root node, nor is there a concept of parents and children. Rather, a graph is a collection of interconnected nodes.
Great article... and worth the time to read.
About Me
Name: Nick
Home: Wauwatosa, WI, United States
I'm a Software Consultant in the Milwaukee area. Among various geeky pursuits, I'm also an amateur triathlete, and enjoy rock climbing. I also like to think I'm a political pundit.
Email Me
View My Profile
Archives
Home Page
Previous Posts
Debugging the DebuggerLiteScribe
Programming in the Blue
Not a Cow... But a Comet?
Intellectual Diversity
C# Frequently Asked Questions
Don't Like John Kerry? Wait a Week.
Bring Out Your Code!
Kerry Not Representing Anyone
Is a Property a Field or Function?
Personal Links
Carnival of the Badger
The Coding Monkey
del.icio.us Links
Flickr Photos
Blog Critics Reviews
Blogroll Me!
music
books
video
culture
politics
sports
gaming
Credits
Design By maystar