Click here to Skip to main content
       

Algorithms

 
GeneralRe: Puzzle 8 Solving with bfs PinmemberAlan Balkany26-Sep-12 4:42 
GeneralRe: Puzzle 8 Solving with bfs Pinmembermohammadkaab26-Sep-12 5:01 
GeneralRe: Puzzle 8 Solving with bfs PinmemberAlan Balkany26-Sep-12 5:09 
GeneralRe: Puzzle 8 Solving with bfs [modified] Pinmembermohammadkaab26-Sep-12 21:36 
QuestionBit Interleaver PinmemberSkippums24-Sep-12 16:07 
QuestionImage processing Pinmemberfabio_antonio23-Sep-12 8:25 
AnswerRe: Image processing PinmemberAlan Balkany24-Sep-12 4:46 
QuestionChecking the network Pinmemberen41115-Sep-12 7:24 
My problem goes something like this. I have a variable of 5 arrays a[5] for storing the 5nodes of a network. The network is randomly formed by the random number generator. I have the time of travel for each paths of the network. All the nodes may not be connected to eachother. The network and the time of travel of each path is as per the user has assigned. Now I have to check the elements of each array and assign the penalty as per the conditions. My main task is to find a network path traveling each node of the network only once such that the node visited is not repeated. Its similar to TSP but the difference is that in TSP has the condition that it is possible to travel from each node to every other node. But for my case the network is pre defined and nodes are not connected to every other nodes in the network.
 
a) Like if the network stored is 2-2-3-4-5 then I find that a[1]=a[2] so I will have to assign the penalty (type 1 )as the network has a path 2-2 which is not possible as the starting and end of the path is same. At the same time for rest of the paths from node 2 to 3, node 3 to 4, node 4 to 5 I will have to calculate the sum of total time of travel when I finally reach the node 5.

b) Also there is another penalty condition if the path is not a possible path in the network given by user then I will have to assign penaly( type 2) for such kind of condition like if 1-2-4-3-5 is a network to be checked. Here I am supposing that all the paths are possible but the path 4-3 doesn’t exist in the real network provided by the user, So for such cases I will have to calculate the sum of the time of travel for the paths which are possible and also assign the penalty (type 2)
 
c) There is also a condition that I need the end point of the network as node 5.So in the network generated randomly if the end node is not the node 5 then I will have to assign the penalty (type 3) and at the same time calculated the sum of the rest possible paths. For example the node 3-5-2-1-4 here the end node is 4 so I will have to assign the penalty(type 4)
 
d) Since I am not allowed to visit the same node twice I will have to assign the (penalty type 4) if the network has repeatition of nodes like if the network is 2-4-3-1-4. Here the node 4 is occurring twice so I will have to assign the penalty(type 4) and also calculate the sum of the time of travel of the other paths.
Considering all the above penalty conditions I will have to check the network s. I am really not being able to use any logic on how do I start. Need some hint on how do I do it.
AnswerlinkRe: Checking the network PinmemberYvesDaoust21-Sep-12 0:11 
Questionan optimal elevator-use algorithm PinmemberBillWoodruff13-Sep-12 3:38 
AnswerRe: an optimal elevator-use algorithm PinmemberAlan Balkany13-Sep-12 4:41 
GeneralRe: an optimal elevator-use algorithm PinmemberBillWoodruff19-Sep-12 4:35 
QuestionPlease, poke holes in my cryptographic function... [modified] PinmemberSixOfTheClock13-Sep-12 0:52 
QuestionWhat kind of checksum can this be? [modified] PinmemberGrooverFromHolland9-Sep-12 9:18 
AnswerRe: What kind of checksum can this be? PinmemberAlan N9-Sep-12 11:55 
GeneralRe: What kind of checksum can this be? PinmemberGrooverFromHolland9-Sep-12 22:15 
QuestionLinear Regression Most Efficient algorithm calc Line of Best Fit PinmemberA*****4-Sep-12 19:24 
AnswerRe: Linear Regression Most Efficient algorithm calc Line of Best Fit [modified] PinmemberPeter_in_27804-Sep-12 20:17 
QuestionRunning out of Memory - Maths Check PinmemberMike-MadBadger3-Sep-12 7:52 
AnswerRe: Running out of Memory - Maths Check [modified] PinmemberAndrei Straut3-Sep-12 9:03 
GeneralRe: Running out of Memory - Maths Check PinmemberMike-MadBadger3-Sep-12 10:11 
GeneralRe: Running out of Memory - Maths Check PinmemberAndrei Straut3-Sep-12 10:56 
GeneralRe: Running out of Memory - Maths Check PinmemberMike-MadBadger3-Sep-12 11:18 
GeneralRe: Running out of Memory - Maths Check Pinmemberharold aptroot3-Sep-12 21:54 
GeneralRe: Running out of Memory - Maths Check PinmemberMike-MadBadger4-Sep-12 0:26 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.


Advertise | Privacy | Mobile
Web04 | 2.8.140916.1 | Last Updated 16 Sep 2014
Copyright © CodeProject, 1999-2014
All Rights Reserved. Terms of Service
Layout: fixed | fluid