MathGroup Archive 2014

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

Search the Archive

Combinatorica versus new graphs in V8

  • To: mathgroup at smc.vnet.net
  • Subject: [mg132474] Combinatorica versus new graphs in V8
  • From: "E. Martin-Serrano" <eMartinSerrano at telefonica.net>
  • Date: Wed, 26 Mar 2014 03:23:09 -0400 (EDT)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-outx@smc.vnet.net
  • Delivered-to: mathgroup-newsendx@smc.vnet.net

Hi,

I am unable to see how to  implement multi edge graphs for pairs of vertices
in V8.

With the =91Combinatorica=92 package this was easy to do as in

<< Combinatorica`

g = Combinatorica`Graph[{{{1, 2}}, {{2, 3}}, {{2, 3}}, {{2, 3}} , {{2, 3}}},
{{{0, 0}}, {{1, 1}}, {{2, 0}}}]

ShowGraph[g]

Here I have three =91{2,3}=92 concurrent edges for the  vertices pair {2,3}

The following should be equivalent for the V8  kernel implementation of
graphs

System`Graph[{UndirectedEdge[1,2], UndirectedEdge[2,3], UndirectedEdge[2,3],
UndirectedEdge[2,3], UndirectedEdge[2,3]},

 VertexCoordinates -> {{0, 0}, {1, 1}, {2, 0}}]

But the multiple edges feature does not work in the way it did in
=91Combinatorica=92 (It does not work in any way).

Please, could anyone say what I am missing here?


E. Martin



__________________________________________

This e-mail and the documents attached are confidential and intended solely
for the addressee; it may also be privileged. If you receive this e-mail in
error, please notify the sender immediately and destroy it. As its integrity
cannot be secured on the Internet, no sender's liability can be triggered
for the message content. Although the sender endeavors to maintain a
computer virus-free network,  he/she does not warrant that this transmission
is virus-free and  will not be liable for any damages resulting from any
virus transmitted.

Este mensaje y los ficheros adjuntos pueden contener informaci=F3n
confidencial destinada solamente a la(s) persona(s) mencionadas
anteriormente y su contenido puede estar protegido por secreto profesional y
en cualquier caso el mensaje en su totalidad est=E1  amparado y protegido por
la legislaci=F3n vigente que preserva el secreto de las comunicaciones, y por
la legislaci=F3n de protecci=F3n de datos de car=E1cter personal. Si usted recibe
este correo electr=F3nico por error, gracias por informar  inmediatamente al
remitente y destruir el mensaje. Al no estar asegurada la integridad de este
mensaje sobre la red, el remitente no se hace responsable por su contenido.
Su contenido no constituye ning=FAn  compromiso para el remitente, salvo
ratificaci=F3n escrita por ambas partes.  Aunque se esfuerza al m=E1ximo por
mantener su red libre de virus, el emisor  no puede garantizar nada al
respecto y no ser=E1 responsable de cualesquiera da=F1os que puedan resultar de
una transmisi=F3n de virus.





  • Prev by Date: Re: Exact Solution to the double well potential problem in
  • Next by Date: Re: Problems with Solve
  • Previous by thread: Re: Exact Solution to the double well potential problem in
  • Next by thread: Re: Combinatorica versus new graphs in V8