>Does anyone from SS want to reply to Andrew's question?
>
>Shortest path, Dijkstra, BFS, etc are all standard graph algorithms. These
>are not SS algorithms, I'm afraid.
>
>Rui
Rui - you are surely not being so unthinking nor, indeed,
discourteous to suggest that either Alasdair or Sheep are unaware of
the origins of the above algorithms or that they would even think of
attempting to pass them off as space syntax algorithms?
Clearly, the fundamental space syntax equations are all in the SLofS
and the majority of us assumed (perhaps wrongly) that Andrew Smith
was asking about the IMPLEMENTATION algorithms of these equations in
the context of larger-scale processing. What has never been published
(for complex historical reasons, which Sheep touched upon) is HOW the
standard ss algorithms are ACTUALLY implemented in real-code in a
manner that is computationally viable (i.e. doesn't take years to
run) for large systems. Indeed, Sheep's answer, in particular, could
not have been more informative, generous and helpful and you respond
in such a petty and insulting manner!
If this was not the information that Andrew Smith was seeking, he can
respond further by being more clear and explicit about what it is
that he is asking.
For the general interest of all others reading this list - I am about
to set up our own in-house 'wikipedia' of space syntax terms. This
will consist of an open-source glossary of terms as well as
algorithms and references. In the nature of all wikipedias this will
be constantly under development - but the intention is that is should
be made available to the list as soon as it is in a useful state.
Andrew - I would more than welcome your contribution to this, should
you be interested, as indeed any other offers.
Ruth Conroy Dalton
UCL
|