From: Benjamin Ylvisaker <ben8@cs.washington.edu>
To: Edgar Friendly <thelema314@gmail.com>
Cc: caml-list@inria.fr
Subject: Re: [Caml-list] ocamlgraph predecessors
Date: Sat, 8 Aug 2009 13:16:28 -0700 [thread overview]
Message-ID: <2877D20A-1008-4CD0-B1B6-F2EA444B2A88@cs.washington.edu> (raw)
In-Reply-To: <4A7D7F1F.8040006@gmail.com>
On Aug 8, 2009, at 6:35 AM, Edgar Friendly wrote:
> Benjamin Ylvisaker wrote:
>> I have been using ocamlgraph for a while, and have been generally
>> happy
>> with it. I experienced some poor performance with moderately large
>> graphs (10-100k vertices) recently, which led me to look through the
>> source code a little. It seems that doing anything with the
>> predecessors of a vertex, even just getting a list of them, requires
>> scanning through all the vertices in a graph. This seems a little
>> crazy
>> to me. Am I missing something? Is there some kind of work-around
>> that
>> gives reasonable performance for predecessor operations (i.e. not
>> O(|V|)).
>>
>> Thanks,
>> Ben
>>
>
> What you're asking is similar to the problem of finding the
> predecessor
> of an arbitrary node in a singly-linked-list. You have no option
> but to
> scan the whole list to find its predecessor. If you had a
> doubly-linked-list, predecessor lookups would work easily, but
> that's a
> different data structure, with much more overhead.
>
> When you talk about "predecessors", I assume you're using a directed
> graph, and want to know which nodes have edges to a given node. if
> your
> graph is static, you could build lookup tables, pregenerating this
> information and caching it. Even with a dynamic graph, maintaining
> lookup tables on this info shouldn't be too hard.
>
> Does that help?
> E
The list analogy seems like a little bit of a stretch to me. I
understand the point, but I think most programmers would expect
predecessor and successor operations in a generic mutable directed
graph library to be symmetric in every way, including performance.
I'm thinking about making a thin wrapper around ocamlgraph that makes
"internal" edges in both directions with tags to distinguish them
whenever the user creates an "external" edge. All the wrapper graph
traversal functions would only use ocamlgraph's successor functions,
and then use the tags to distinguish which edges are really supposed
to point in which direction. It's a bit of a hassle, and will roughly
double the amount of storage required for edges, but I need
predecessor access in my application, and the O(|V|) performance is
really painful for big graphs.
Ben
next prev parent reply other threads:[~2009-08-08 20:16 UTC|newest]
Thread overview: 13+ messages / expand[flat|nested] mbox.gz Atom feed top
2009-08-08 5:24 Benjamin Ylvisaker
2009-08-08 13:35 ` [Caml-list] " Edgar Friendly
2009-08-08 20:16 ` Benjamin Ylvisaker [this message]
2009-08-09 14:56 ` Edgar Friendly
2009-08-25 14:22 ` Julien Signoles
2009-08-25 14:22 ` Julien Signoles
2009-08-26 14:35 ` Benjamin Ylvisaker
2009-08-26 6:54 ` Jean-Christophe Filliâtre
2009-08-09 18:32 rixed
2009-08-10 1:59 ` Jacques Garrigue
2009-08-10 12:19 ` kcheung
2009-08-10 17:46 ` Benjamin Ylvisaker
2009-08-12 22:40 ` Francis Dupont
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=2877D20A-1008-4CD0-B1B6-F2EA444B2A88@cs.washington.edu \
--to=ben8@cs.washington.edu \
--cc=caml-list@inria.fr \
--cc=thelema314@gmail.com \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).