The graph used an array of Node to represent edges, which is suitable only for small classes that have operator==(). Change the internal representation to use indexes for edges instead of the node classes and add an API for adding edges by index. Rewrite the visit() algorithm to create an index list instead of a node list. Move the Node from NodeEntry to a separate node list, which allows for copying it directly from the node list passed in. Task-number: PYSIDE-2946 Task-number: PYSIDE-454 Pick-to: 6.8 Change-Id: I7becd5caef226f50b77f5def2a62a2620d39ef8e Reviewed-by: Cristian Maureira-Fredes <cristian.maureira-fredes@qt.io>