Detecting Cycles During Insertion of a new node in an undirected graph | Together C & C++ | Page 1

versed dagger Oct 17, 2022, 5:47 AM

#

How to do this in c++

vernal magnetBOT Oct 17, 2022, 5:47 AM

#

When your question is answered use !solved to mark the question as resolved.

Remember to ask specific questions, provide necessary details, and reduce your question to its simplest form. For more information use !howto ask.

sleek juniper Oct 17, 2022, 4:21 PM

#

versed dagger How to do this in c++

it's not the nodes getting inserted that cause cycles, it's the edges

#

what are you trying to detect

vernal magnetBOT Oct 18, 2022, 5:21 AM

#

This question thread is being automatically closed. If your question is not answered feel free to bump the post or re-ask. Take a look at !howto ask for tips on improving your question.

versed dagger Oct 18, 2022, 4:02 PM

#

after inserting a node it checks for cycle

#

if node is like connected to other one

thorn walrus Oct 18, 2022, 4:59 PM

#

probably Floyd's algorithm, this would likely be the same in any language, not just C++

#

https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_and_hare

Cycle detection

In computer science, cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values.
For any function f that maps a finite set S to itself, and any initial value x0 in S, the sequence of iterated function values

vernal magnetBOT Oct 19, 2022, 5:21 AM

#

This question thread is being automatically closed. If your question is not answered feel free to bump the post or re-ask. Take a look at !howto ask for tips on improving your question.

#Detecting Cycles During Insertion of a new node in an undirected graph