Hi Nitin,
I don't have the answer, but you may be interested to browse older
communication
from Roberto Micarelli, the original author:
http://www.nabble.com/-GRASS5--Re%3A-shortest-path-tf3092080.html#a8585507
The nabble.com site offers a nice search engine.
Please keep us posted on your findings to finally document them.
Markus
Nitin-7 wrote:
>>> Hello friends,
> This mail is in refrence with directed graph library of GRASS.
>> I am not able to find difference between flattened graph and tree as
> operation in library differs for both.
>> I am trying to extract graph used for network vector analysis. Currently i
> am trying on modification of v.example . I am putting following cmd
>> Vect_net_build_graph(&In,0x02,1 ,2 ,NULL,NULL,NULL,1,0)
>> This return success but with flatten graphs ( DGL_GS_FLAT ) .
>> In what cases on using API Vect_net_build_graph() will provide us with
> dgnGraph_s type object having edge and node tree graph.
>> kindly help ,
> regards
> nitin
> _______________________________________________
> grass-dev mailing list
>grass-dev at grass.itc.it>http://grass.itc.it/mailman/listinfo/grass-dev>
--
View this message in context: http://www.nabble.com/difference-between-flatten-graph-and-a-tree-tf3720971.html#a10421084
Sent from the Grass - Dev mailing list archive at Nabble.com.