<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html;charset=ISO-8859-1" http-equiv="Content-Type">
</head>
<body bgcolor="#ffffff" text="#000000">
Hamish wrote:
<blockquote cite="mid:246049.40424.qm@web110009.mail.gq1.yahoo.com"
type="cite">
<pre wrap="">Richard wrote:
</pre>
<blockquote type="cite">
<pre wrap="">I found a brute-force way to identify the unreachable
categories; I set up a loop in d.path to connect all
categories to all others, with the output pipelined to a
text file along with cats.
</pre>
</blockquote>
<pre wrap=""><!---->MN:
</pre>
<blockquote type="cite">
<blockquote type="cite">
<pre wrap="">Wouldn't v.net do the job?
</pre>
</blockquote>
</blockquote>
<pre wrap=""><!---->RC:
</pre>
<blockquote type="cite">
<pre wrap="">I had already run v.net to create the connection from point
to network. Where it fell down was for points that couldn't
connect, because v.net.steiner reports the failure to
connect using node number rather than category number (so
for eg the cat might be 10 but the node 639). My nasty
brute-force was to create a text file that clearly put node
number and cat number together.
(The network was roads; the points that didn't connect were
in the water, which is fair enough I suppose!)
</pre>
</blockquote>
<pre wrap=""><!---->
how about v.net.iso then split away areas with infinite cost.
?
Hamish
</pre>
</blockquote>
Thanks, I'll give that a try.<br>
<br>
Richard<br>
</body>
</html>