OJ Board

Can one help me to solve this puzzle please

there will be G=(V,E) not directed graph that its vertices
V={v1...,vn} appear in this order on the axis of Real numbers
(for every 1<=i<j<=n vi appears before vj).


a d-division of the vertices of G is a division of them to d different sections,
meaning ...

In a direct graph calculates a set U of nodes (u maximal) such there is a path (not necessarily simple) that passes via all U nodes .
Can anyone suggest to which broader category of algorithms this problem can belong to

Thank's for ideas

In a network i want to find the number of alternate shortes paths from a start node to all other nodes. Normally Dijkstra can be used.
But because there are no weights BFS should also working.
I can modify BFS algorithm so that pred (n) doesn't only store one predecessor
but a list of possible ...

Hi
many thanks for your help. but i'm trying to understand the technique u described.
for the moment for me looks ofuscated . hwy 2^K factor.

I think that we may have k! masks (all permutation of the k nodes.)

I was thinking to something like
calculate the distance between the two subraphs ...

Hi
many thanks for your help. but i'm trying to understand the technique u described.
for the moment for me looks ofuscated . hwy 2^K factor.

I think that we may have k! masks (all permutation of the k nodes.)

I was thinking to something like
calculate the distance between the two subraphs ...

I have a undirected graph
One node is labelled 'start', one is 'end', and there's about a dozen labelled 'mustpass'.

I need to find the shortest path through this graph that starts at 'start', ends at 'end', and passes through all of the 'mustpass' nodes (in any order).

In graphs (V,E) with negative edge weights but with no negative cycles , X <V and s, t in V .
I need an algorithm to decide if exist in the graph shortest path from s to t with
which includes all the nodes from X
i've tried to modify A* , Bellman-Ford algorithms but without success .

I think this is a very smart idea! Thanks.

Please give in your ideas and suggestions for best algorithm on the following problems :

We have a graph G=(V,E) and a function of weight on the edges w:E->R we have a couple of two vertexes s,t and an edge e we suppose that there is not cycle with a negative weight find an algorithm that ...

Thanks for the ideas of solving.

Kruskal's algorithm goes like this: it loops over graph's edges in order of increasing cost, and adds current edge to the MST, unless doing so would create a cycle in it.

When some edges have equal cost, the algorithm is indeterministic: by changing the order in ...

Can someone suggest some good algorithm for this ?

Which would be modifications in the algorithm's Kruskal?

So you think I can use KrusKal to enumerate 2nd MST ?
Why kruskal and not PRIM

How can I solve this?
g(v,e) undirected with weight >=0
give an algorithm which test
if G has Minimum spanning tree uniq
two MST