Project Description
This project presents a simple directed graph implementation for the .NET framework using C# language.

The implementation tries to be as fast as possible and delivers these facilities:
  • Adding and removing a vertex O(1)
  • Adding and removing a edge O(1)
  • Changing weight of a vertex or an edge O(1)
  • Getting parents or children of any vertex O(1)
  • Detecting cycles O(e+v)
  • Computing the topological order O(e+v)
  • Depth/Breath First Searches O(e+v)
  • Computing the critical path O(e+v)
  • Exporting to DOT language O(e+v)
  • Needed Space O(e)

Last edited Dec 27, 2010 at 4:14 PM by SaeedSh, version 2