Kjell Magne Fauske | 5 Aug 14:06
Picon

Re: Algorithmically generating acyclic source-terminal network graphs

On Wed, Aug 5, 2009 at 1:28 PM, Roberto
Nibali<roberto.nibali <at> mavt.ethz.ch> wrote:

> It would be nice if someone with significantly more Latex experience
> than me created an extension to Alain Matthes' tkz-graph package. I
> fancy the design path taken by the existing PGF/TIKZ framework,
> however there is still a large hurdle to overcome for the proficiency
> required to be productive. My probably worthless 2 cents here: This
> whole world of creating series-parallel reducible (in my case also:
> acyclic digraphs) with a source and terminal nodes is frequently used
> in reliability theory, including partly in network coding and network
> flow analysis fields. It would allow a broad range of researchers in
> these fields to spice up their papers with Latex-compliant visibly
> adequate graphical representations of said graphs.

Could you post a link to an example of a more complicated graph that
you want to draw?

- Kjell Magne Fauske

------------------------------------------------------------------------------
Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day 
trial. Simplify your report design, integration and deployment - and focus on 
what you do best, core application coding. Discover what's new with 
Crystal Reports now.  http://p.sf.net/sfu/bobj-july

Gmane