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.

Cleans the up orphaned inheritance based forfs, which will be orphaned due to the removal of the edge passed in.

Constructs the target per entity hierarchies for entities.

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.

Deserializes the entity definitions from reader.

Deserializes the relationships from reader.

Destroys the hierarchies.

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.

Gets all addable entities which are addable to the typed list specified

Gets all the entity definitions in flat enumerable

Gets all entities, grouped by the group they're in

Gets all fields, inherited and defined for groupable element specified. First all fields inherited are returned, then the fields of the element itself. ValueTypeDefinitions can't inherit from other types, they return only the fields of themselves.

Gets all inherited relationships for entity, grouped by supertype

Gets all normal relationships available in the entity model.

Gets all related entities of the entity specified (with the relationship(s) over which they're related), including related entities over inherited relationships.

Gets all relationship based unique constraints for the entity specified. Relationship based unique constraints are unique constraints which are not defined in the model itself but are present for 1:1 FK/UC-PK relationships where the entity specified is at the FK side. Only direct relationships are considered, not inherited relationships.

Gets all relationships for the entity specified.

Gets all relationships of the specified types for entity.

Gets all supertype candidates for the subtype passed in.

Gets all supertype candidates to which all entities in subtypes can be made a subtype of.

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 all the edges which end in the endVertex specified.

Gets the entities in this graph topological sorted. This means that they're sorted based on the inheritance hierarchies they're in. All other entities are not considered depending on other entities. This method is not sorting based on relationships, but solely on inheritance hierachies.

Gets the entities topological sorted based on normal relationships. this means that they're sorted based on the 1:1/1:n/m:1 relationships they're in. All entities not having these relationships are not considered depending on other entities. Inheritance relationships are not taken into account.

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.

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).

Makes the entities in the enumerable passed in abstract / not abstract

Creates a shallow copy of the current Object.

Moves the fields specified to destination from source, if destination and source are in the same inheritance hierarchy

Obtains per entity definition the unique constraints with per UC the mappable fields it is build from.

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

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.

Removes the fieldelements based on the passed in fieldtype

Replaces the relationship passed in

Serializes the data in this class to the serializer passed in

Sets the super type for entity. To remove an entity as subtype altogether, pass null for newSuperType. If the entity already has a supertype set, it's first removed as a subtype from that entity. If the subType entity has subtypes and newSuperType is null, subType becomes the new root for these subtypes, so it forms a new hierarchy.

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.