Graph

A GraphPreconditionFailure is thrown whenever a precondition of a graph manipulation operation does not hold. The preconditions are described in the JavaDoc comment for each operation.

Add an edge to the graph from the source vertex to the target vertex. Fail if either vertex is not present in the graph or if it already contains an edge from the source vertex to the target vertex.

Add a vertex to the graph. Fail if the vertex is already present in the graph. The vertex initially has no edges within this graph.

Add a collection of vertices to the graph. Fail if any vertex is already present in the graph, or if it occurs multiple times in the given collection. The vertices initially have no edges within this graph.

Create a subgraph containing each of the provided vertices and all of their ancestors.

Remove all edges and vertices from the graph.

If the given vertex is present in the graph, remove its incoming and outgoing edges, then the vertex itself. If the given vertex is not in the graph, do nothing.

Remove an edge from the graph, from the source vertex to the target vertex. Fail if either vertex is not present in the graph. If there is no such edge in the graph then do nothing.

Remove all edges from the graph which originate at the given vertex. Fail if the vertex is not present in the graph.

Remove all edges from the graph which terminate at the given vertex. Fail if the vertex is not present in the graph.

Remove a vertex from the graph, removing any connected edges. Do nothing if the vertex is not in the graph.

Add an edge to the graph from the source vertex to the target vertex. Fail if either vertex is not present in the graph. If the graph already contains an edge from the source vertex to the target vertex then do nothing.

Determine if the graph contains an edge from the source vertex to the target vertex. Fail if either vertex is not present in the graph.

Determine if the given vertex is in the graph.

Add a vertex to the graph if it's not already present. If the vertex is already present, do nothing. If the vertex is added it initially has no edges within this graph.

Visit the vertices in DAG order. The action is invoked for each vertex, also passing a completion action to invoke when that vertex visit is considered complete, allowing successors for which all predecessors have completed to be visited.

Visit the vertices in DAG order. The action is invoked for each vertex, also passing a completion action to invoke when that vertex visit is considered complete, allowing successors for which all predecessors have completed to be visited.

Answer the set of predecessors of the specified vertex. Fail if the vertex is not present in the graph.

Remove an edge from the graph, from the source vertex to the target vertex. Fail if either vertex is not present in the graph, or if there is no such edge in the graph.

Remove a vertex from the graph, failing if it has any connected edges. Fail if the vertex is not present in the graph.

Answer the set of successors of the specified vertex. Fail if the vertex is not present in the graph.

Given an acyclic graph, produce a subgraph that excludes any edges for which there is another path connecting those edges in the original graph.

A subgraph of an acyclic graph that excludes any edges for which there is another path connecting those edges in the original graph.

The first cycle in this cyclic graph, as a List of vertices in the order in which they occur in the cycle.

true iff the graph is cyclic, otherwise false.

true if the graph is empty, false otherwise.

A copy of this Graph with the same vertices, but with every edge having the reverse direction.

The roots of the graph. These are the vertices with no incoming edges.

The number of edges in the graph.

An acyclic subgraph of the receiver, containing all vertices, and a locally maximal subset of the edges (i.e., no additional edge of the original graph can be added without making the resulting graph acyclic).

The vertex count of the graph.

The graph's vertices.