freakolgist
Newbie
- Dec 4, 2008
- 8
- 2
Umm .... oldenstylehats ....
Where is graph theory in this ?
You have just made it complex....
Instead of intertwining them.... just follow a simple sequential path ->
1->2->3->4->5->6->7 ..... KISS (Keep It Simple)
I personally think the method in the image posted by red1leafs is efficient provided that the round about loops 1-7,2-8 are removed and instead pointed to one single MAJOR node , say 1. 1 should rank very well then ...
http://img407.imageshack.us/my.php?image=307303123935cb840771modvn8.jpg
Where is graph theory in this ?
You have just made it complex....
Instead of intertwining them.... just follow a simple sequential path ->
1->2->3->4->5->6->7 ..... KISS (Keep It Simple)
I personally think the method in the image posted by red1leafs is efficient provided that the round about loops 1-7,2-8 are removed and instead pointed to one single MAJOR node , say 1. 1 should rank very well then ...
http://img407.imageshack.us/my.php?image=307303123935cb840771modvn8.jpg