The eagerly awaited Part 5 of Scott Mitchell’s Data Structure series is now live

Check it out here

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.

Comments (3)

  1. Rj says:

    I was surprised not to find the link on Scott’s website. Thank you for the heads up!

  2. I’ll get it linked up eventually. I just found out about it myself about 10 minutes ago! 🙂

  3. Mike says:

    Isn’t it your editor job a MSDN article be titled correctly?

    Why “Extensive Examination of Data Structures”?

    Why not just “Quick’n’dirty Introduction” ? (No offence intended)