[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] Diameter in directed graphs
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] Diameter in directed graphs |
Date: |
Tue, 9 Nov 2010 00:02:34 +0000 |
> I wanted to double-check how diameter is calculated for directed vs.
> undirected graphs. Does the logic below make sense? Directed graphs stop
> the geodesic when it reaches the end of a direct path?
>
> 1) if directed=true, diameter of *->*->*->*<-* will be 3 (because longest
> possible direct path is 3?)
> 2) if directed=false, diameter of *->*->*->*<-* will be 4 (ignoring edge
> directions?)
Yes, it works exactly this way.
--
Tamas