Watch....Film....Serial killer
Yesterday i was watchin this film based on a true story
The Zodiac Killer is one of the great mysteries of all time
For years the Zodiac taunted the police with weird ciphers,
phone calls, insulting and cryptic messages. This killer
changed the lives of eight people, only two of whom lived
to tell the tale but the case was never officially solved...
Guess what i got a letter of Zodiac yesterday too
You want to know who the killer is??? It is Leah!!!
(I solved the mysterie? You be the judge)
Sunday, October 7, 2007
Wednesday, October 3, 2007
Prim's algorithm
Prim's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm was discovered in 1930 by mathematician Vojtěch Jarník and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Dijkstra in 1959. Therefore it is sometimes called the DJP algorithm or Jarnik algorithm
A simple implementation using an adjacency matrix graph representation and searching an array of weights to find the minimum weight edge to add requires O(V^2) running time. Using a simple binary heap data structure and an adjacency list representation, Prim's algorithm can be shown to run in time which is O(Elog V) where E is the number of edges and V is the number of vertices. Using a more sophisticated Fibonacci heap, this can be brought down to O(E + Vlog V), which is significantly faster when the graph is dense enough that E is Ω(Vlog V).
The algorithm continuously increases the size of a tree starting with a single vertex until it spans all the vertices.
Input: A connected weighted graph G(V,E)
Initialize: V' = {x}, where x is an arbitrary node from V, E'= {}
repeat until V'=V:
Choose edge (u,v) from E with minimal weight such that u is in V' and v is not in V' (if there are multiple edges with the same weight, choose arbitrarily)
Add v to V', add (u,v) to E'
Output: G(V',E') is the minimal spanning tree
A simple implementation using an adjacency matrix graph representation and searching an array of weights to find the minimum weight edge to add requires O(V^2) running time. Using a simple binary heap data structure and an adjacency list representation, Prim's algorithm can be shown to run in time which is O(Elog V) where E is the number of edges and V is the number of vertices. Using a more sophisticated Fibonacci heap, this can be brought down to O(E + Vlog V), which is significantly faster when the graph is dense enough that E is Ω(Vlog V).
The algorithm continuously increases the size of a tree starting with a single vertex until it spans all the vertices.
Input: A connected weighted graph G(V,E)
Initialize: V' = {x}, where x is an arbitrary node from V, E'= {}
repeat until V'=V:
Choose edge (u,v) from E with minimal weight such that u is in V' and v is not in V' (if there are multiple edges with the same weight, choose arbitrarily)
Add v to V', add (u,v) to E'
Output: G(V',E') is the minimal spanning tree
Friday, September 28, 2007
18th
this's been my 18th :-) hahahaah
Leah you owe me 3 songs :) hahaha
i'm evil
okay i write here something...
you infected me my tooth's gettin' hurt
i guess this is my wisdom tooth again
i dont want it!!! i'm wisdom enuogh :)
yesterday i went to work (to the press)
and half way i got a call:
"sorry you dont have to come ...
X Y is sick, no work today"
hrrrrrr i got really really mad
Leah you owe me 3 songs :) hahaha
i'm evil
okay i write here something...
you infected me my tooth's gettin' hurt
i guess this is my wisdom tooth again
i dont want it!!! i'm wisdom enuogh :)
yesterday i went to work (to the press)
and half way i got a call:
"sorry you dont have to come ...
X Y is sick, no work today"
hrrrrrr i got really really mad
Wednesday, September 26, 2007
estoy un tigre en la cama
yeah i got my letter from Leah and i got my dollar
i've already spent it all
i bought a new house, a sport car
and the other part is for slaves :P
just kidding but that would be nice :)
Yesterday i went to the library so that to lent a book
It's a 3D graphic book for study of one of my classes
i checd out through the internet, before i went,
they may have it and the site said there are 5 untaken
So i went to the library and told i need this book
and they said there is no more book Haaah? Why?
I got so angry Is that so hard to keep up todate that site????
This week is really boring I have to learn a lot
b/c i'm gonna have an exam about 4
years maths classes on 10th Oct.
I have to map out my everydays
Tomorrow i'm workin' in a press :) fun
It's kinda phisical work but i'm interesed in
i've already spent it all
i bought a new house, a sport car
and the other part is for slaves :P
just kidding but that would be nice :)
Yesterday i went to the library so that to lent a book
It's a 3D graphic book for study of one of my classes
i checd out through the internet, before i went,
they may have it and the site said there are 5 untaken
So i went to the library and told i need this book
and they said there is no more book Haaah? Why?
I got so angry Is that so hard to keep up todate that site????
This week is really boring I have to learn a lot
b/c i'm gonna have an exam about 4
years maths classes on 10th Oct.
I have to map out my everydays
Tomorrow i'm workin' in a press :) fun
It's kinda phisical work but i'm interesed in
Saturday, September 15, 2007
to be sick
umm this week was so busy
Monday: first i had to finishe a contract for two girls
They fond the right flat but they had to pay the rent
The only problem that was they have limit on the card
and it's not that easy to call the bank in usa and rise the limit
so finally we had to go back to the office on tuesday to pay
and to write down the contract. But finally everything went ok
Monday night was "meet your mentors" It means every mentor
got 10 forign students and this was the first time to meet each other
We met at the Oktogon in the downtown and went together to
the Csep Café. It's kinda turkish restaurant and cafe
You can smoke hookah here and they have turkish dance every friday
I had 6 out my 10 students It's not that wrong We talked about
why did they choose even Hungary where are they from and so on
After than all the groups met at West Balkan (disco) and party together
Get to know party is on tuesday.This is managed by the mentors in the campus
Every body asked how is it possible????????
I just told Welcome to Hungary where everything happens' :) haha
We organised funny palys and I was the bar tender I have to tell you
they was so "thursty" :)
Okay i get back write shorter. All week went like this Study Help Party
So the end of this week i got sick. Now i'm sneezing and caughing Sux
Monday: first i had to finishe a contract for two girls
They fond the right flat but they had to pay the rent
The only problem that was they have limit on the card
and it's not that easy to call the bank in usa and rise the limit
so finally we had to go back to the office on tuesday to pay
and to write down the contract. But finally everything went ok
Monday night was "meet your mentors" It means every mentor
got 10 forign students and this was the first time to meet each other
We met at the Oktogon in the downtown and went together to
the Csep Café. It's kinda turkish restaurant and cafe
You can smoke hookah here and they have turkish dance every friday
I had 6 out my 10 students It's not that wrong We talked about
why did they choose even Hungary where are they from and so on
After than all the groups met at West Balkan (disco) and party together
Get to know party is on tuesday.This is managed by the mentors in the campus
Every body asked how is it possible????????
I just told Welcome to Hungary where everything happens' :) haha
We organised funny palys and I was the bar tender I have to tell you
they was so "thursty" :)
Okay i get back write shorter. All week went like this Study Help Party
So the end of this week i got sick. Now i'm sneezing and caughing Sux
Sunday, September 2, 2007
overall
on friday i went to the capital to my university to have a conversation
because i'm a mentor and i will help the foreign students to find a flat
i the night i had a big party with my friends we went to a bar and
karaoke all night long. After that we get a pub and drunk a last beer
but my friend thought his a formula one driver and he watered me
with his beer. Thank you Greg :) I arrived home on saturday at about 8 am
and i just woke up 1 pm. 5 hours sleep. Not too much
In the night i played some football and talked with Leah
Well it's work again on monday. But i have to arrived only 10 so
i need to get up at about 8 am. It's not so early but
i am not gonna be abel to speak with Leah. Lo siento
because i'm a mentor and i will help the foreign students to find a flat
i the night i had a big party with my friends we went to a bar and
karaoke all night long. After that we get a pub and drunk a last beer
but my friend thought his a formula one driver and he watered me
with his beer. Thank you Greg :) I arrived home on saturday at about 8 am
and i just woke up 1 pm. 5 hours sleep. Not too much
In the night i played some football and talked with Leah
Well it's work again on monday. But i have to arrived only 10 so
i need to get up at about 8 am. It's not so early but
i am not gonna be abel to speak with Leah. Lo siento
Subscribe to:
Posts (Atom)