*   <li>For {@link Network}:
   *       <ul>
   *         <li>{@code adjacentNodes(node)}: Stable order
   *         <li>{@code predecessors(node)}: Connecting edge insertion order
   *         <li>{@code successors(node)}: Connecting edge insertion order
   *         <li>{@code incidentEdges(node)}: Stable order
   *         <li>{@code inEdges(node)}: Edge insertion order
   *         <li>{@code outEdges(node)}: Edge insertion order

 * <li>{@link #client} - OpenSearch client.</li>
 * <li>{@link #index} - Index name.</li>
 * <li>{@link #settings} - Suggest settings.</li>
 * <li>{@link #supportedFields} - Supported fields for suggestions.</li>
 * <li>{@link #tagFieldNames} - Tag field names.</li>
 * <li>{@link #roleFieldName} - Role field name.</li>
 * <li>{@link #langFieldName} - Language field name.</li>
 * <li>{@link #badWords} - List of bad words.</li>

 * terms</a>):
 *
 * <ul>
 *   <li>directed graphs
 *   <li>undirected graphs
 *   <li>graphs that do/don't allow parallel edges
 *   <li>graphs that do/don't allow self-loops
 *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
 *   <li>graphs whose edges are <a

 * href="https://github.com/google/guava/wiki/GraphsExplained#definitions">definitions of
 * terms</a>):
 *
 * <ul>
 *   <li>directed graphs
 *   <li>undirected graphs
 *   <li>graphs that do/don't allow self-loops
 *   <li>graphs whose nodes/edges are insertion-ordered, sorted, or unordered
 * </ul>
 *
 * <p>{@code Graph} explicitly does not support parallel edges, and forbids implementations or

	    Parameter and result names are not required to match.</li>

	<li>Two interface types are identical if they define the same type set.
	</li>

	<li>Two map types are identical if they have identical key and element types.</li>

	<li>Two channel types are identical if they have identical element types and
	    the same direction.</li>

	<li>Two <a href="#Instantiations">instantiated</a> types are identical if

 *
 * <ol>
 *   <li>The offset of the label in the {@code stringPool}.
 *   <li>The index of the first child node in the {@code trieData}.
 *   <li>A bitfield containing:
 *       <ul>
 *         <li>Bits 0-10: Number of children.
 *         <li>Bit 11: Whether this node represents an exclusion (!rule).
 *         <li>Bits 12-13: The type of wildcard match (*.rule) at this node (0=none, 1=REGISTRY,

 *   <li>{@link #elevateWord()} - Returns an instance of ElevateWordSettings.</li>
 * </ul>
 *
 * <p>Timeout settings can be accessed via:</p>
 * <ul>
 *   <li>{@link #getScrollTimeout()}</li>
 *   <li>{@link #getSearchTimeout()}</li>
 *   <li>{@link #getIndexTimeout()}</li>
 *   <li>{@link #getIndicesTimeout()}</li>
 *   <li>{@link #getBulkTimeout()}</li>
 *   <li>{@link #getClusterTimeout()}</li>
 * </ul>
 *

 * </ul>
 * <p>
 * <b>Repository and Profile Pruning</b>: The consumer POM removal strategy:
 * <ul>
 *   <li>Removes the central repository (only non-central repositories are kept)</li>
 *   <li>Removes build, mailing lists, issue management, and other build-specific information</li>
 *   <li>Removes profiles that have no activation, build, dependencies, or properties</li>

   *       fail.
   *   <li>If the constructor or factory method takes a parameter that {@link
   *       AbstractPackageSanityTests} doesn't know how to construct, the test will fail.
   *   <li>If there is no visible constructor or visible static factory method declared by {@code
   *       C}, {@code C} is skipped for serialization test, even if it implements {@link
   *       Serializable}.

   *       fail.
   *   <li>If the constructor or factory method takes a parameter that {@link
   *       AbstractPackageSanityTests} doesn't know how to construct, the test will fail.
   *   <li>If there is no visible constructor or visible static factory method declared by {@code
   *       C}, {@code C} is skipped for serialization test, even if it implements {@link
   *       Serializable}.