Hi Victor,
The number of times a line appears in all shortest paths is called
'choice' or 'betweenness centrality'. Integration is based on the
average distance from a line to all others. You can find some
explanation in the manual of my software (also available in
Portuguese) and in my MSc thesis (Portuguese only):
http://www.mindwalk.com.br/papers/
Yes, you can do it using Dijkstra's. This is the way I have done and I
believe other space syntax software too.
Good luck,
Lucas Figueiredo
On 17/05/07, Victor Ferreira <[log in to unmask]> wrote:
> Hello,
> i am taking a class in programming, and am trying to implement the
> integration calculation of space syntax.
> In the available papers i read that the integration is the number of times a
> line appears in all the shortest paths between every two lines of the axial
> map... what algorithm is usually used in finding these shortest paths?
> Dijkstra's?
> And how do i decide between several equally shortest paths between two
> lines... keep the last/or the first/all of them?
>
> Sorry if this are very basic questions... but i'm a very basic "programmer"
> :-)
> I am programming with vba, inside arcgis, and the part of finding
> intersections, and building the graph i think i got it covered...
>
> Victor Ferreira
|