Draw a simple connected directed graph
solved
Last edited on
1 2 3 4 5 6 7 8 9 10
|
X X
X X
X X
X X
| |
Not sure if this is covered by a C++ forum.
but if I remember my maths you should start with the above shape.
Hope this gets you started
Shredded
alright then thank you. But can some one finish this problem and explain how its done?
ok sorry I didnt finish it it should go something like this
1 2 3 4 5 6 7 8 9 10
|
1 2
8 3
7 4
6 5
| |
1->2
2->3
3->4
4->5
5->6
6->7
7->8
8->1
1->4
4->7
7->2
2->5
5->8
8->3
3->6
6->1
hope thats what you were after
Shredded
Thank you so much!!!
Topic archived. No new replies allowed.