Uses of Class
specialized_checkers.collection.CheckerGraph

Packages that use CheckerGraph

Package	Description
specialized_checkers.collection
util

Uses of CheckerGraph in specialized_checkers.collection

Subclasses with type arguments of type CheckerGraph in specialized_checkers.collection

Modifier and Type	Class	Description
class	CheckerGraph<N,E extends Number>	A specialized checker for validating properties and constraints on graph data structures.

Methods in specialized_checkers.collection that return CheckerGraph

Modifier and Type	Method	Description
CheckerGraph<N,E>	CheckerGraph.allEdgesMatch(Predicate<Graph.Edge<N,E>> condition)	Checks if all edges in the graph match the given condition.
CheckerGraph<N,E>	CheckerGraph.allNodesMatch(Predicate<N> condition)	Checks if all nodes in the graph match the given condition.
CheckerGraph<N,E>	CheckerGraph.anyEdgesMatch(Predicate<Graph.Edge<N,E>> condition)	Checks if any edge in the graph matches the given condition.
CheckerGraph<N,E>	CheckerGraph.anyNodesMatch(Predicate<N> condition)	Checks if any node in the graph matches the given condition.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<N> nodes, Collection<Graph.Edge<N,E>> edges)	Creates a CheckerGraph from a collection of nodes and edges with a default name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<N> nodes, Collection<Graph.Edge<N,E>> edges, boolean directed)	Creates a CheckerGraph from a collection of nodes and edges, specifying if the graph is directed, with a default name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<N> nodes, Collection<Graph.Edge<N,E>> edges, boolean directed, String name)	Creates a CheckerGraph from a collection of nodes and edges, specifying if the graph is directed, and assigns a name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<N> nodes, Collection<Graph.Edge<N,E>> edges, String name)	Creates a CheckerGraph from a collection of nodes and edges, and assigns a name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<Graph.Edge<N,E>> edges)	Creates a CheckerGraph from a collection of edges with a default name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<Graph.Edge<N,E>> edges, boolean directed)	Creates a CheckerGraph from a collection of edges, specifying if the graph is directed, with a default name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<Graph.Edge<N,E>> edges, boolean directed, String name)	Creates a CheckerGraph from a collection of edges, specifying if the graph is directed, and assigns a name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Collection<Graph.Edge<N,E>> edges, String name)	Creates a CheckerGraph from a collection of edges and assigns a name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Graph<N,E> graph)	Creates a CheckerGraph for the given graph with a default name.
static <N, E extends Number> CheckerGraph<N,E>	CheckerGraph.check(Graph<N,E> graph, String name)	Creates a CheckerGraph for the given graph and assigns a custom name.
CheckerGraph<N,E>	CheckerGraph.containsEdge(N from, N to)	Checks if the graph contains an edge from one node to another.
CheckerGraph<N,E>	CheckerGraph.containsEdge(Graph.Edge<N,E> edge)	Checks if the graph contains the specified edge.
CheckerGraph<N,E>	CheckerGraph.containsNode(N node)	Checks if the graph contains the specified node.
CheckerGraph<N,E>	CheckerGraph.hasCycle()	Checks if the graph contains at least one cycle.
CheckerGraph<N,E>	CheckerGraph.hasPath(N start, N end)	Checks if there is a path between two nodes in the graph.
CheckerGraph<N,E>	CheckerGraph.inRangeEdges(int min, int max)	Checks if the number of edges in the graph is within the specified range (inclusive).
CheckerGraph<N,E>	CheckerGraph.inRangeNodes(int min, int max)	Checks if the number of nodes in the graph is within the specified range (inclusive).
CheckerGraph<N,E>	CheckerGraph.inRangeWeight(double min, double max)	Checks if all edge weights in the graph are within the specified range (inclusive).
CheckerGraph<N,E>	CheckerGraph.isBinaryTree()	Checks if the graph is a binary tree (each node has at most two children).
CheckerGraph<N,E>	CheckerGraph.isConnected()	Checks if the graph is connected (there is a path between every pair of nodes).
CheckerGraph<N,E>	CheckerGraph.isDirected()	Checks if the graph is directed.
CheckerGraph<N,E>	CheckerGraph.isEmpty()	Checks if the graph is empty (contains no nodes).
CheckerGraph<N,E>	CheckerGraph.isTree()	Checks if the graph is a tree (connected and acyclic).
CheckerGraph<N,E>	CheckerGraph.maxEdges(int max)	Checks if the graph has at most the specified maximum number of edges.
CheckerGraph<N,E>	CheckerGraph.maxNodes(int max)	Checks if the graph has at most the specified maximum number of nodes.
CheckerGraph<N,E>	CheckerGraph.maxWeight(double max)	Checks if all edge weights in the graph are at most the specified maximum value.
CheckerGraph<N,E>	CheckerGraph.minEdges(int min)	Checks if the graph has at least the specified minimum number of edges.
CheckerGraph<N,E>	CheckerGraph.minNodes(int min)	Checks if the graph has at least the specified minimum number of nodes.
CheckerGraph<N,E>	CheckerGraph.minWeight(double min)	Checks if all edge weights in the graph are at least the specified minimum value.
protected CheckerGraph<N,E>	CheckerGraph.self()	Returns this instance (for fluent API).

Uses of CheckerGraph in util

Methods in util that return CheckerGraph

Modifier and Type	Method	Description
<N, E extends Number> CheckerGraph<N,E>	Checker.isGraph(Collection<N> nodes, Collection<Graph.Edge<N,E>> edges)	Creates a CheckerGraph for the given nodes and edges (undirected by default).
<N, E extends Number> CheckerGraph<N,E>	Checker.isGraph(Collection<N> nodes, Collection<Graph.Edge<N,E>> edges, boolean directed)	Creates a CheckerGraph for the given nodes, edges, and directionality.
<N, E extends Number> CheckerGraph<N,E>	Checker.isGraph(Collection<Graph.Edge<N,E>> edges)	Creates a CheckerGraph for the given edges (undirected by default).
<N, E extends Number> CheckerGraph<N,E>	Checker.isGraph(Collection<Graph.Edge<N,E>> edges, boolean directed)	Creates a CheckerGraph for the given edges and directionality.