Package graphql.schema.diffing
-
Class Summary Class Description DiffImpl This is an algorithm calculating the optimal edit to change the source graph into the target graph.DiffImpl.OptimalEdit An optimal edit from one graph to another.Edge EditOperation An edit operation between two graphs can be one of six types: insert vertex, delete vertex, change vertex, insert edge, delete edge, change edgeEditorialCostForMapping HungarianAlgorithm An implementation of the Hungarian algorithm for solving the assignment problem.Mapping A mapping (in the math sense) from a list of vertices to another list of vertices.PossibleMappingsCalculator We don't want to allow arbitrary schema changes.PossibleMappingsCalculator.VertexContextSegment SchemaDiffing SchemaGraph SchemaGraphFactory Util Vertex Vertex.VertexData -
Enum Summary Enum Description EditOperation.Operation -
Exception Summary Exception Description SchemaDiffingCancelledException