I was assigned a project in which i had to implement some algorithms concerning graphs. The last one is the one described in the title. I have to make an algorithm that uses McLane's theorem (https://en.wikipedia.org/wiki/Mac_Lane%27s_planarity_criterion) to test whether a graph is planar or not. Now, to do that i have to find something called a 'Complete set of basic circuits', as our professor says. I have searched round a bit, and i could not find this term.
As noted in the book, A complete set of basic circuits S is a set of circles in which: 1) Every circle in S can be expressed as the ring sum of some or all of the circles in S 2) No circle in S can be expressed as the ring sum of any circle that does not belong to S.
Does anyone know how a 'Complete set of basic cricuit' is calculated? Any guidance would be appreciated.