Find Lowest Number of Double Edges Before a Complete Graph is Made

[MuellMark]

This is option one of two for me to work on next. This would likely need #32 to be create first, and I'd need to come up with a good algorithm to do this. This issue will be for brainstorming before branching off and trying different things

[MuellMark]

After working on #32, I feel like I'll need to work out some sort of algorithm for this one too. The more I consider adding in #32, the less confident I am in its approach. I'm not entirely sure on whether or not I should close it, but that option is definitely on the table

[MuellMark]

After working with Circulant graphs for the past month, this problem was put on the back burner. While #32 could be used as a starting point, what would be better would be to generate an algorithm by hand, then try and implement it. A lot of work would need to be put into this problem, but it's definitely and option for the future