Hi, for a long time I'm having a problem with one graph algorithm. After checking two and spending few days on it I've no more ideas what to do. Maybe you can give me some pieces of advice which algorithm should I use to solve such problem: Assume we have a n-vertice graph with m-edges. The edges are given in input. My task is to find if it is possible to connect each vertice with exactly two other vertices. Every edge can be used two times. The maximum lenght of path which connects two vertices is 3. For graph with edges 1 2 2 3 the answer is YES, because we can make such connections: 1-2 2-3 1-2-3 I'll be greatful for any possible help. regards, Jeth
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
