Implement a iterator for spanning trees and planarity testing that avoids copying data for edges

Registered by David Gleich

At the moment, computing spanning trees using kruskal's algorithm makes an extra copy of the spanning tree internally. This also happens with the kurtowski subgraph in the planar graph algorithms. We should avoid these copies.

Blueprint information

Status:
Not started
Approver:
None
Priority:
Undefined
Drafter:
None
Direction:
Needs approval
Assignee:
None
Definition:
New
Series goal:
None
Implementation:
Unknown
Milestone target:
None

Related branches

Sprints

Whiteboard

(?)

Work Items

This blueprint contains Public information 
Everyone can see this information.

Subscribers

No subscribers.