http://howtodecodersa.altervista.org...-in-logarithm/

thanks in advance for your opinions ]]>

can we use dijkstra's algorithm here to find the shortest path from A to H? or use bellman-ford algorithm.

i think using dijkstra's algorithm but I am not sure about that.

depth first search sequence started from vertex A=ABEDHIFCGJ

breadth first search sequence started from vertex A=ABDEFIHCGJ

am i correct?

can we use dijkstra's algorithm to find shortest path ????and why?

I have to write a thermodynamic model with matlab using the

minimization of gibbs free energy

do u which method is the best for solving the nonlinear equation

system in this case?

thank´s ]]>

Each segment object is something like this:

Connection: {

PointA = p1

PointB = p2

pointA_is_connected = true (false for the first or last segment)

pointB_is_connected = true (false for the first or last segment)

}

I want to create a path from one end to another in one direction with all segments that can be connected to each other. All the segments in an array are segments of a ONE path.

Here is an image of what I have (in red) and what I want to have (in green)

What's the best way to achieve this?

I am working with a data structure that has to be handled and implemented in a relational database having nested fields of SHARES with lists of OWNERS related to each leaf node of the shares. See attached Model Image:

The model represents Two Basic information Share and Owners. Shares are also represented in plain form for calculation purpose. (2592, 24, 40 are the total of shares at respective level)

Given E={e1..en}, n>=0, a set of positive integers (e for entity)

Given L={l1..lm}, m>=0, a set of positive integers (l for location)

Given P:E --> L , a function. (P for position)

Given C:L --> IN*, a function. (C for capacity)

Given U:L --> IN, a function. (U for used) defined by: U(l)=card({e/P(e)=l})

Given A:L --> IN, a function. (A for available) defined by: C(l)=A(l)+U(l) for any l in L.

Let D:E --> L^k, where 0 < k <= m, D(e)=(l1,l2,..li) a function (D for destinations)

(That is, each entity has an ordered non-empty list of locations (destinations) willing to move to).

Let I:E --> IR+, a bijection (I for Importance). (That is, each entity has a unique importance number I(e))

II/Rules of Migration:

The asked task, is to find out the new P' function (Positioning) that affords the following:

1- P'(e) belongs to {l'1,l'2,..,l'i} where (l'1,l'2,..,l'i)=D(e)

2- If we P'(e)=l's and P'(e)=l't are two possible solutions, where D(e) = (l'1,...,l's,...,l't,...,l'i), then we must keep the solution that matches the destinations' order (i.e l's in this case) and exclude the other one)

3-If A(l) = 1 and P(e1)=l and P(e2)=l are two possible solutions, where I(e1)>I(e2) then we must keep the solution that matches the importance's order (i.e in this case P(e1)=l) and exclude the other one.

4- If none of the desired destinations is possible, then P'(e)=P(e)

Which algorithmic problem would match this one, Thanks. ]]>