The surprisig truth about what motivates us
a tiny slice of my sky
I have found this web site : http://www.stimator.com/
Hi

> It's done! If anyone has a
> mountain top from where they can proclaim it, this would be a good
> time to let some people know about Jython.
>
> Charlie
>
I knew that work around existing software is not so simple but I didn't think that it could cause me so many problems.


' '------------------------------------------------------------------
' ' A (very bad) implementation of Dijkstra's algorithm to find the minimum
' ' path in a single source graph
' '
' ' Input : The graph and the start node (a station of our metropolitan)
' ' Output : the dictionary of minimum paths
' '
' ' Note : Due to the impossibility to use a real Priority Queue it is implemented as a linear array
' ' and the varius push and pop operations are maked "in-line"
' ' The elemnts in the queue are lists(that are not changed during theelaborations)
' ' made of :
' ' a) The minimum estimated distance from the source node
' ' b) The node that precede it in the optimum path from the source to
' ' the current node
' ' c) current examinde node
' '------------------------------------------------------------------
' Input reading (Paramiters are spcified trought the SELF reference)
G = SELF.Get(0) ' Graph
startNode = SELF.Get(1) ' Starting node (the starting train station)
endNode = SELF.Get(2) ' Final destination
D = Dictionary.Make(_StimaLunghezzaMassimaDiUnPercorso) ' minimum distance dictionary
P = Dictionary.Make(_StimaNumeroStazioniNelPercorsoOttimo) ' predecessor's dictionary
Q = {{0,nil,startNode}} ' List of "(estimated distance, predecessor, current node)" ; the initial node have a 0 distance from itself
while (Q.count >0) ' The algorithm will end whenn there will be no more distance to be evaluated
' From Q we select the element with the minimum weight
mintupla = Q.get(0)
for each tupla in Q
if( tupla.get(0)< style="color: rgb(204, 102, 204);">then 'Verify if v is in D D_contain_v = D.add(v,100) 'if D contain v D.add return False
if(d_contain_v) then 'if so it means that we have added it so we will remove it D.remove(v) 'to restore the previus situation end
if(D_contain_v) then d_contain_v = false else d_contain_v = true end if (D_contain_v) then ' If D have the node in exame it means that we have continue ' yett found an optimale distance and so we can jump it : good :-) end
D.add(v, dist)
P.add(v, pred)
key_list = G.ReturnKeys Lista ={} for each id in key_list Lista.add(id.get(0)) end branch_list_v = G.get(v)
'now we analyze the distanceses of the node v from his neighbors w
for each w in branch_list_v.ReturnKeys
'Optimal distance from the source to the endpoint node v
start_v_lenght = D.get(v)
'distance under exam from v to the neighboring w
v_w_lenght = branch_list_v.get(w)
'EXTIMATION of the optimum distance form the source to w
vwLength = start_v_lenght + v_w_lenght
tuplaToPop = {vwLength,v,w} 'we insert w and w predecessor's (v) in the optimum walk
' and the distance from w to the source of the walk
'we do the pop in the queue Q.insert(tuplaToPop)
end 'for
end 'while
return P 'for our purpose, it interests only us the dictionary of the walks.
'Then we avoid to also return the dictionary of the distances (D) No frontiers for open source people...even too open some time!

Being a computer scientist is not a simple thing;
something finally stirs in the world of Jython
To help who is less fortunate is, without doubt, a noble action but really I am not able of to understand the sense of Windows Starter Edition.
My second blog have changed the address, so, it is now
Yesterday I have read the SourceForge mailing list and a news founded in it has attracted my attention:
Hi, by now I've a new blog!
One of the most interesting entry in the programmer's world was some years ago the Java programming language
A sad day.
Great news!
Hi!
Hmm...this Eckel's post is related to the last of mine
The era is not good for poor informatics.
Bruce Eckel give his answers to common questions (i.e. FAQ ;-) )about Python Language.
It's the time for oral part of the school-leaving examination (in Italy I means)!
I'm trying to use the RSSify at Wytheville Community College.
The E-Day is near (i.e. the "examination day" for the novice to this blog ^___^)
Are you a developer? A Java developer?
Do you need a tool to draw ER Diagram, UML models, electronic circuits and so on?
Hi, today I'have some problem with my internet connection...so I'don't now if this post will be publish...i hope!
Not a glorius weekend 4 me!