Re: Convert directed graph to undirected graph

*To*: mathgroup at smc.vnet.net*Subject*: [mg111194] Re: Convert directed graph to undirected graph*From*: Robert Wright <mathematicauser1 at yahoo.com>*Date*: Fri, 23 Jul 2010 07:11:50 -0400 (EDT)

Bob, I suspect Jon is about to show us how this can be done with one alpha character in F# ;-) I considered updating my 1989 vintage Fortran skills recently and thought the new parallel Fortran would be the way to go, however, Jon has certainly made me wonder whether F# is a credible scientific workhorse. Every now and then, I solve something in Mathematica and wish I had a faster computational engine...especially when ploting vector fields. That said, it's not often I need the extra speed and Mathematica does a fantastic job in most cases. Are others using F#, and if so, what are your thoughts: is it a realistic replacement for Mathematica's enormous functionality, or niche companion? R ________________________________ From: Bob Hanlon <hanlonr at cox.net> To: mathgroup at smc.vnet.net Sent: Thu, July 22, 2010 4:41:02 AM Subject: [mg111194] [mg111148] Re: Convert directed graph to undirected graph gr1 == GraphPlot[{ 1 -> 2, 2 -> 1, 3 -> 1, 3 -> 2, 4 -> 1, 4 -> 2, 4 -> 4}, DirectedEdges -> True] gr2 == gr1 /. Arrow -> Line Bob Hanlon ---- Jon Harrop <usenet at ffconsultancy.com> wrote: ========================== What is the recommended way of doing this in Mathematica? -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com