The Graph Smart library contains common graph ADT's and associated algorithms that are not in the .NET Framework class library. Graph Smart is different because it leverages generic programming to achieve better compile time constraint validation, design flexibiliy, and run time performance than was possible with earlier versions of the .NET Framework.

• Red black binary search tree
• B-tree
• Graph ADT
• Common shortest path algorithms
• Common search algorithms
• Network flow algorithms
• Visual output of graphs
• Performance gaurantees
• Aggregate ADTs extend ICollection<T> and IEnumerable<T> to support easy integration with other .NET classes.
• Thread safe