Re: [igraph] bow tie

[Tamas Nepusz]

Hi,

Ah, understood. Well, one thing that you can do is to

1) extract the largest weakly connected component to get rid of the
disconnected nodes, let's name this graph G

2) classify G's nodes as in-, out-, and core nodes.

3) run layout.fruchterman.reingold with different constraints set on the
in-, out- and core components. Say, you could specify that nodes of the
in-component must stay in (0,0)-(1,1), the core must stay in (1,0)-(2,1) and
the out-component must stay in (2,0)-(3,1). You can specify these using the
minx, maxx, miny and maxy arguments.

I don't know whether the resulting layout would actually be useable or not,
but this is what I would try first.

-- 
T.