Find cycles result is wrong!

[sonygod]

//the result only get 3 circles?

	const vertexA = new GraphVertex('A');
	const vertexB = new GraphVertex('B');
	const vertexC = new GraphVertex('C');
	const vertexD = new GraphVertex('D');
	const vertexE = new GraphVertex('E');
	const vertexF = new GraphVertex('F');
	const vertexM = new GraphVertex('M');
	const vertexN = new GraphVertex('N');

	const edgeAM = new GraphEdge(vertexA, vertexM);
	const edgeAD = new GraphEdge(vertexA, vertexD);
	const edgeAE = new GraphEdge(vertexA, vertexE);

	const edgeDE = new GraphEdge(vertexD, vertexE);
	const edgeDN = new GraphEdge(vertexD, vertexN);


	const edgeEM = new GraphEdge(vertexE, vertexM);
	const edgeEF = new GraphEdge(vertexE, vertexF);
	const edgeEN = new GraphEdge(vertexE, vertexN);




	const edgeFM = new GraphEdge(vertexF, vertexM);
	const edgeFB = new GraphEdge(vertexF, vertexB);
	const edgeFC = new GraphEdge(vertexF, vertexC);
	const edgeFN = new GraphEdge(vertexF, vertexN);


	const edgeBM = new GraphEdge(vertexB, vertexM);
	const edgeBC = new GraphEdge(vertexB, vertexC);

	const edgeCN = new GraphEdge(vertexC, vertexN);

	const graph2 = new Graph();


	graph2
	  .addEdge(edgeAM)
	  .addEdge(edgeAE)
	  .addEdge(edgeAD)
	  .addEdge(edgeDN)
	  .addEdge(edgeDE)
	  .addEdge(edgeEF)
	  .addEdge(edgeEM)
	  .addEdge(edgeEN)
	  .addEdge(edgeFM)
	  .addEdge(edgeFN)
	  .addEdge(edgeFB)
	  .addEdge(edgeFC)
	  .addEdge(edgeBM)
	  .addEdge(edgeBC)
	  .addEdge(edgeCN);

	var resultC=detectUndirectedCycle(graph2);  

	console.log(resultC);

[ktrongnhan]

Hi @sonygod,
Can you show me the 3 cycles you got ?
For my own try, I only get one : A - E - M - A which does seem to be correct as detectUndirectedCycle() is merely supposed to find out whether or not there is a cycle in a given graph

Hi @trekhleb,
Does it sound reasonable to you ?

[ktrongnhan]

Duplicate of #252