MathGroup Archive 2010

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Changing Graph style

  • To: mathgroup at smc.vnet.net
  • Subject: [mg114528] Re: Changing Graph style
  • From: Murray Eisenberg <murray at math.umass.edu>
  • Date: Tue, 7 Dec 2010 06:43:53 -0500 (EST)

But that example is still a directed multigraph.

On 12/5/2010 9:54 PM, Yaroslav Bulatov wrote:
> On Dec 4, 3:11 am, dr DanW<dmaxwar... at gmail.com>  wrote:
>> Particularly disappointing is that Graph can't deal with mixed graphs
>> (directed and undirected edges in the same graph) or multiple edges
>> between  a single pair of nodes.  This limits Graph from working with
>> many legitimate and interesting graph problems.  They sure look
>> pretty, though.
>>
>> Daniel
>
> How about
> Graph[{1 ->  2, 2 ->  3, 3 ->  2}] for a graph with 1 undirected and 1
> directed edge and using EdgeWeight to represent multiplicity of each
> edge?
>

-- 
Murray Eisenberg                     murray at math.umass.edu
Mathematics & Statistics Dept.
Lederle Graduate Research Tower      phone 413 549-1020 (H)
University of Massachusetts                413 545-2859 (W)
710 North Pleasant Street            fax   413 545-1801
Amherst, MA 01003-9305


  • Prev by Date: JLink on virtual Linux server: Cannot createKernelLink
  • Next by Date: GraphPlot
  • Previous by thread: Re: Changing Graph style
  • Next by thread: Reduce::inex problem