Adds the provided edge to this graph. If the vertex(s) are not yet in this graph, it/they are added as well.

Adds the provided vertex to this graph.

Adds all elements (i.e. vertices and edges) from the provided graph to this graph.

Returns a composition of the two provided graphs. See http://en.wikipedia.org/wiki/Lexicographic_product_of_graphs.

Determines whether this graph contains the edge object specified.

Returns whether a vertex exists in this graph.

Returns whether an edge exists in this graph between the start vertex and the end vertex specified.

Removes all edges from this graph between startVertex and endVertex. It will only remove edges between startVertex and endVertex, not between endVertex and startVertex, unless bothSides is set to true, then all edges between both vertices are removed, discarding their direction.

Determines whether the specified object is equal to the current object.

Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.

Gets the adjacency list for vertex. The adjacency list is a list of TVertex - Hashset(Of TEdge) tuples, as a vertex can have multiple edges with the same related vertex.

Creates a NonDirectedGraph version of this graph. Always creates a copy, even if this graph is a non-directed graph.

Gets all the edges between startVertex and endVertex.

Gets all the edges started from the startvertex specified.

Gets the edges as list, and perform this operation synced with the SyncRoot, to avoid threading issues.

Gets all the edges which end in the endVertex specified.

Serves as the default hash function.

Gets the orphaned vertices. Orphaned vertices are vertices which are not part of any edge in the graph

Gets a subgraph from this graph with the vertices and edges which match the functions specified. It creates a new instance and places the same vertex and edge instances in that graph.

Gets the Type of the current instance.

Gets the vertices as list, and perform this operation synced with the SyncRoot, to avoid threading issues.

A graph is called connected if every pair of distinct vertices in the graph is connected (directly or indirectly). A connected component is a maximal connected subgraph of G. Each vertex belongs to exactly one connected component, as does each edge. A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph. It is strongly connected or strong if it contains a directed path from u to v and a directed path from v to u for every pair of vertices u,v. The strong components are the maximal strongly connected subgraphs. See http://en.wikipedia.org/wiki/Connectivity_(graph_theory) We will only check for a connected un-directed graph or a weakly connected directed graph (same logic).

Creates a shallow copy of the current Object.

Called when an edge has been added

Called when an edge is about to be added

Called when an edge has been removed

Called when an edge is about to be removed

Called when a vertex has been added

Called when a vertex is about to be added

Called when a vertex has been removed

Called when a vertex is about to be removed

Performs the specified action, either inside a lock on SyncRoot if this graph is Synchronized, or normally, if the graph isn't synchronized.

Performs the specified action, either inside a lock on SyncRoot if this graph is Synchronized, or normally, if the graph isn't synchronized.

Removes the provided edge from the graph.

Removes a vertex from this graph.

Removes all elements (i.e. vertices and edges) of the provided graph from this graph.

Removes all elements (i.e. vertices and/or edges) of the provided graph from this graph.

Returns a String that represents the current Object.

Validates if the edge passed in is addable to this graph structure. The start vertex and the end vertex for the are given as well. The same edge is present between startVertex and endVertex and also between endVertex and startVertex if the graph is a nondirected graph, hence the necessity of these two vertices in this routine

Validates if the edge passed in is removable from this graph structure. The start vertex and the end vertex for the are given as well. The same edge is present between startVertex and endVertex and also between endVertex and startVertex if the graph is a nondirected graph, hence the necessity of these two vertices in this routine

Validates if the vertex passed in is addable to this graph structure.

Validates if the vertex passed in is removable from this graph structure.

Validates if the vertexToRemove passed in is removable from the adjacency list of the vertex vertex. Removing the vertex means all edges from vertex to vertexToRemove are physically removed from the graph structure.