ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Wed, 07 Mar 2018 13:21:06 +0100Flow gives error for disconnected verticeshttps://ask.sagemath.org/question/41419/flow-gives-error-for-disconnected-vertices/ When calculating the flow between to vertices which are not connected in a graph, the method returns a ValueError. I would have assumed that it would just return 0. Here's a minimal example:
G=Graph({0:[],1:[]})
G.flow(0,1) # raises the error ValueError: vertex '0' is not in the (di)graph
If on the other hand one tries the shortest_path method it just returns a empty list, since there is not path between 0 and 1.
G.shortest_path(0,1) #returns []AckslWed, 07 Mar 2018 13:21:06 +0100https://ask.sagemath.org/question/41419/Random block graphhttps://ask.sagemath.org/question/37433/random-block-graph/ How can I get a random connected graph with m blocks so that each block is a k-clique (complete graph with k vertices). Deepak SarmaWed, 26 Apr 2017 13:35:00 +0200https://ask.sagemath.org/question/37433/