<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
</head>
<body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">
I just tried v.net.allpairs and it is really nice now. Thanks much.
<div><br>
</div>
<div>One thing that is confusing is that the text for both entries alayer and nlayer shows up as "Layer number or name" instead of the text that is actually in the description field "Arc layer" and "Node layer". Any idea why this is so?</div>
<div><br>
</div>
<div>I've attached a saved display for the results of v.net.allpairs with the streets_wake map (nc_08 demo data) for the arcs and highschools for the nodes.</div>
<div><br>
</div>
<div>Michael<br>
<div><br>
</div>
<div><br>
</div>
<div><img height="52" width="122.58" apple-width="yes" apple-height="yes" id="0abd15e7-0a5b-4c28-b1d9-be0fcec19a65" src="cid:1A67C5AB-7DA7-4265-958F-1CCE8DEF40FB@dbc.local"><br>
<div apple-content-edited="true">____________________<br>
C. Michael Barton<br>
Director, Center for Social Dynamics & Complexity <br>
Professor of Anthropology, School of Human Evolution & Social Change<br>
Arizona State University<br>
<br>
voice: <span class="Apple-tab-span" style="white-space:pre"> </span>480-965-6262 (SHESC), 480-727-9746 (CSDC)<br>
fax: 480-965-7671 (SHESC), 480-727-0709 (CSDC)<br>
www: <a href="http://www.public.asu.edu/~cmbarton">http://www.public.asu.edu/~cmbarton</a>,
<a href="http://csdc.asu.edu">http://csdc.asu.edu</a><br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
<br>
</div>
<br>
<div>
<div>On Oct 13, 2012, at 5:15 AM, Markus Metz <<a href="mailto:markus.metz.giswork@gmail.com">markus.metz.giswork@gmail.com</a>> wrote:</div>
<br class="Apple-interchange-newline">
<blockquote type="cite">On Mon, Oct 8, 2012 at 6:18 PM, Moritz Lennert<br>
<<a href="mailto:mlennert@club.worldonline.be">mlennert@club.worldonline.be</a>> wrote:<br>
<blockquote type="cite">On 08/10/12 18:09, Markus Metz wrote:<br>
<blockquote type="cite"><br>
On Mon, Oct 8, 2012 at 5:28 PM, Moritz Lennert<br>
</blockquote>
<br>
<br>
<blockquote type="cite">
<blockquote type="cite">In trunk, the result is a vector map of nodes with an attribute table<br>
linked<br>
to these nodes which provides a distance matrix across the network for<br>
all<br>
pairs of nodes.<br>
<br>
I agree that this is suboptimal output. I think the following outputs<br>
would<br>
be interesting:<br>
<br>
- a table with the distance matrix, but this does not have to be linked<br>
to a<br>
map (cf v.distance table option)<br>
</blockquote>
<br>
<br>
+1<br>
I would prefer output as a matrix to a file (or stdout) with a custom<br>
field separator instead of an attribute table. I guess (at least I<br>
would take that route) that post-processing of that output is done<br>
outside GRASS.<br>
</blockquote>
<br>
<br>
I guess that could be left to the user (e.g. table=- for stdout ?).<br>
Sometimes it can be handy to have that table in the same database as the<br>
vector attribute layers as you might want to use it in a view which you can<br>
then attach back to the vector map or in another type SQL statement linked<br>
to your mapset...<br>
<br>
<br>
<blockquote type="cite"><br>
There is a bug in the current implementation of v.net.allpairs: there<br>
are multiple entries for the same category and layer in the output<br>
attribute table. This is not supported by GRASS.<br>
</blockquote>
<br>
<br>
Right. Didn't even think about that when I saw the table.<br>
<br>
<br>
<blockquote type="cite"><br>
<blockquote type="cite">- a map with all the paths<br>
<br>
I would guess that the code is in the <a href="http://v.net">v.net</a> modules (notably v.net.path)<br>
to<br>
easily create a map of paths. MarkusM ?<br>
</blockquote>
<br>
<br>
Yes, that should be easy. I would suggest to change v.net.allpairs<br>
such that the output contains all the paths. Each path gets its own<br>
category, and the attribute table holds information about the start<br>
node, end node, and cost to get from the start node to the end node.<br>
Additionally, a matrix can be printed to file or stdout with the costs<br>
of travelling from the start node to the end node. This matrix is not<br>
symmetric because the cost of travelling from A to B is not<br>
necessarily equal to the cost of travelling from B to A (one-way<br>
streets for example).<br>
</blockquote>
<br>
<br>
+1, although I'm still not convinced that the matrix as a table cannot be<br>
useful if you don't want the whole map, but only the info. But I won't make<br>
an issue out of it, as you can use the attribute table of the map to get the<br>
same results.<br>
</blockquote>
<br>
I have changed the output of v.net.allpairs in r53379 to hold the<br>
selected nodes and all paths between them. The attribute table for the<br>
paths has the entries cat, from_cat, to_cat, cost with cat = category<br>
of path, from_cat and to_cat = categories of start and end point, and<br>
cost = cost.<br>
<br>
Printing the costs out in matrix form is not implemented, but would be<br>
easy to add.<br>
<br>
Markus M<br>
</blockquote>
</div>
<br>
</div>
</div>
</body>
</html>