Is it possible to make C# program for printing all paths in envelope form graph

Question

1.00/5 (1 vote)

See more:

I want to write a program in C# which will find all paths of open flap envelope form graph (or pentagon graph, see Picture link) without repetition and without lifting the pen;
Example solutions are: 321542534; 451234253.
- pls see what I've tried so far
- Picture link
- this is an unweighted undirected graph
- to make the path vertices can be visited more that once
- all vertices must be visited
- no edge repetition

Please help me, I'm new to coding :) tnx

What I have tried:

I tried so far:
Detect cycle in an undirected graph - GeeksforGeeks[^]
Shortest cycle in an undirected unweighted graph - GeeksforGeeks[^]

Posted 2-Jun-20 3:38am

skp2235

Updated 2-Jun-20 5:08am

Add a Solution

Comments

F-ES Sitecore 2-Jun-20 10:21am

This isn't a code-on-deman site where we do your homework for you. If someone else does your work then you have learned nothing yourself. Break the problem up into smaller chunks and solve them individually. Feel free to ask specific questions about specific problems, but we aren't going to do it all for you.

skp2235 2-Jun-20 10:31am

Thanks for your helpful answer :)

Richard MacCutchan 2-Jun-20 11:30am

"Please help me, I'm new to coding"
Forget this and spend some time learning C# and the fundamental .NET classes.

skp2235 2-Jun-20 17:12pm

Wow, thanks for your helpful answer :)

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Maciej Los · Answer 1 · 2020-06-02T05:09:00

Solution 1

Check this out: Graphs and Dijkstra’s Algorithm (C#) – Bits and Pieces of Code[^]

For further details, please see: Shortest path problem - Wikipedia[^]

Posted 2-Jun-20 5:09am

Maciej Los

Comments

skp2235 2-Jun-20 17:12pm

Thanks but it doesn't help. This algorithm prints shortest paths, I want specific path like my question