Spotted via code inspection: method

org.hibernate.graph.EntityGraphs#areEqual(java.util.Map<java.lang.Class,jakarta.persistence.Subgraph>, java.util.Map<java.lang.Class,jakarta.persistence.Subgraph>)

is essentially comparing two entry sets, but attemtping an upfront equals check on all keys and then iterating on each key and again comparing for existence on the second set, followed by value lookup of both keys.

I’d suggest reduing the O of iterations; it seems the value lookup could be more expensive than the initial checks so perhaps a two-pass iteration is in order.