One quesiton about Combinatorica
- To: mathgroup at smc.vnet.net
- Subject: [mg51317] One quesiton about Combinatorica
- From: Peng Yu <pengyu.ut at gmail.com>
- Date: Thu, 14 Oct 2004 06:36:09 -0400 (EDT)
- Organization: The University of Texas at Austin; Austin, Texas
- Sender: owner-wri-mathgroup at wolfram.com
I have a few point in 2-dimension. (3,0),(2,8),(1,5),(4,5) I want to find the ShortestPathSpanningTree and the sum of edges' weights of this spanning tree. Could you tell me how to generated a graph with all vertex on grids? The distance between two vertices are difined in terms of Manhattan distance. Here is a simple example in Combinatorica's tutorial, but I don't know what function can substitute the function GridGraph. ShowGraph[ShortestPathSpanningTree[GridGraph[5, 5], 1]]; Peng