On Dec 4, 1:34 pm, "smartdude" <[EMAIL PROTECTED]> wrote:
> In graph theoretical terms the problem is to find a minimal (or a
> reasonably sized) vertex cover of a graph using complete multipartite
> graphs.
Thanks! You have given me much to think about.
After some introductory reading on graph
Hi,
I think the question is not to FORM A MATRIX, but to PRINT the elements
in the form of spiral matrix, where the problem of SEQUENTIAL OUTPUT
comes...
-Vikram
On 12/6/06, Gene <[EMAIL PROTECTED]> wrote:
>
>
>
> hijkl wrote:
> > this question was asked by Google..
> > "Write a program of sp
Let G = (V,E, c) be a flow network and f is a flow on G.
How to prove that summation of f(s,u) = the summation of f(v,t)
Note: (s,u) and (v,t) belongs to E
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
"Algorithm
So you mean my friend's algorithm works? As the modified graph can find
the shotest path 1->3 instead of 1->2->3.
jackyy
Atamyrat Hezretguliyew 寫道：
> On 12/6/06, jackyy <[EMAIL PROTECTED]> wrote:
> >
> > My friend has the following idea to get an algorithm for finding a
> > shortest path tree o
hijkl wrote:
> this question was asked by Google..
> "Write a program of spiral matrix"
> ie. it takes inputs and puts in to matrix as a spiral..example.
> given : 3 X 4 matrix
> your input in this order : 1 5 8 9 10 7 4 8 0 2 3 6
> will generate following matrix
>
> 1 5 8 9
> 2 3 6 10
Should be O(n) where n is the number of inputs.
Keep a displacement info for 4 directions ... strictly in this order: right,
down, left, up. Starting from the top left corner/cell and current
direction is right ... continue putting the numbers one by one and advance
the cell based on your current
this question was asked by Google..
"Write a program of spiral matrix"
ie. it takes inputs and puts in to matrix as a spiral..example.
given : 3 X 4 matrix
your input in this order : 1 5 8 9 10 7 4 8 0 2 3 6
will generate following matrix
1 5 8 9
2 3 6 10
0 8 4 7
and big O notatio
On 12/6/06, jackyy <[EMAIL PROTECTED]> wrote:
>
> My friend has the following idea to get an algorithm for finding a
> shortest path tree on
> a graph whose edges may have negative length (but with no negative
> cycle):
>
> (i) Examine the edges and find the edge e with the most negative
> length.
On 12/6/06, jackyy <[EMAIL PROTECTED]> wrote:
>
> Let G = (V,E) be a directed graph and s and t be two specific vertices
> in G. We say
> that s and t are k-connected if there are at least k edge-disjoint
> paths between s and t.
> Therefore, is there any algorithm to decide whether s and t are
>
My friend has the following idea to get an algorithm for finding a
shortest path tree on
a graph whose edges may have negative length (but with no negative
cycle):
(i) Examine the edges and find the edge e with the most negative
length.
(ii) Add |ℓ(e)|, the absolute value of the length of e, to t
Let G = (V,E) be a directed graph and s and t be two specific vertices
in G. We say
that s and t are k-connected if there are at least k edge-disjoint
paths between s and t.
Therefore, is there any algorithm to decide whether s and t are
k-connected?
Can you explain the algorithm in details?
--~
11 matches
Mail list logo
