Basic crawler class which crawls over all vertices in the graph it is set to crawl. For every visited vertex, it will call a visit routine, which can be overriden in derived classes. Depth first search is discussed here: http://en.wikipedia.org/wiki/Depth_first_search and it's the base for many graph known algorithms. An alternative is breadth first search, which uses a method which is non-recursive.

Class which represents a directed edge in a graph. A directed edge from A to B means A has a connection with B but B doesn't have a connection with A.

Basic class which simply makes the graph base act like a directed graph.

Class which represents an edge in a graph. It can be used for directed and non-directed edges. A directed edge from A to B means A has a connection with B but B doesn't have a connection with A.

abstract base class for graphs. It can handle non-directed and directed graphs. A directed edge from A to B means that A has a connection with B, but B doesn't have a connection with A.

Class which is used to store event args in for the change event args of the graph.

Class which represents a non-directed edge in a graph. A non-directed edge between A and B means that the edge represents A to B but also B to A.

Basic class which simply makes the graph base act like a non-directed graph.

Class which represents a subgraph view on a main graph with a subset of the vertices/edges of the main graph.

Interface to be used with Edge classes in graphs.

Simple interface which is used on the RootDetector class to be able to create multiple different typed instances in the same routine.