[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] Shortest circuit (distance to self)

From: Gábor Csárdi
Subject: Re: [igraph] Shortest circuit (distance to self)
Date: Wed, 27 Jun 2012 11:06:03 -0400

Yes, I'm afraid that you'll have to write this for yourself, there is
no function for it in igraph currently. There are functions for BFS in
igraph, however, so you could either just use them with their
callbacks, or modify their C code.


On Wed, Jun 27, 2012 at 6:04 AM, Nicholas Dahm <address@hidden> wrote:
> Hi All,
> For reasons I won't get into, I wish to find the shortest path from a node to 
> itself, passing each edge only once in a simple undirected graph. For a 
> directed graph, this is easy, however on an undirected graph I see no easy 
> way to do this other than to write my own best-first search algorithm. My 
> graphs are simple (no self-edges and no more than 1 edge between 2 nodes).
> Any thoughts?
> cheers
> Nick
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help

Gabor Csardi <address@hidden>     MTA KFKI RMKI

reply via email to

[Prev in Thread] Current Thread [Next in Thread]