Changeset 7320:3a4dace4227b
- Timestamp:
- 11/06/07 15:54:12 (6 years ago)
- Branch:
- default
- File:
-
- 1 edited
-
sage/graphs/graph.py (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
sage/graphs/graph.py
r7318 r7320 5224 5224 sage: edges4 = g.min_spanning_tree(weight_function=lambda (v,w,l): 1/(v+w+1)^2) 5225 5225 sage: len(edges4) 5226 145226 49 5227 5227 5228 5228 """ … … 5233 5233 # Kruskal's algorithm 5234 5234 edges=[] 5235 sorted_edges_iterator=iter(sorted(self.edges(), cmp= lambda x,y: cmp(weight_function(x),weight_function(y))))5235 sorted_edges_iterator=iter(sorted(self.edges(), cmp=cmp)) 5236 5236 union_find = dict([(v,None) for v in self.vertex_iterator()]) 5237 5237 for i in xrange(self.order()):
Note: See TracChangeset
for help on using the changeset viewer.
