On Fri, 10 Jan 2014 23:14:48 -0700
Daniel Schwen <lists(a)schwen.de> wrote:
Yeah, well, I guess what's done is done. It took
me only two weeks of fun work.
I suspect that my tool is a bit faster as well. My loop finding on the
commons tree takes under 8 seconds (and that covers _all_ categories,
without relying on a root category).
That sounds fast. The find-cycles function in Catgraph is basically
just a quick hack based on BFS which I did the evening after
Wikimania, so it's no wonder that there is room for optimization.
You store the page_ids of namespace 14, right? What's your RSS?
This is also a fun project for me for the
communication part
(websocket streaming of data) and the UI side on commons, with a focus
on simple standard tasks like finding FPs and implementing the
shortest path finding.
The UI feels very responsive, I like it.
I am a bit puzzled why I did not know about catgraph.
Either I has my
head stuck in the sand or that project is not well advertised.
I suck at advertising. Catgraph has existed since 2011.
--
Johannes Kroll
Softwareentwickler
Wikimedia Deutschland e.V. | Tempelhofer Ufer 23-24 | 10963 Berlin
Tel. (030) 219 158 26-0
http://wikimedia.de
Wikimedia Deutschland - Gesellschaft zur Förderung Freien Wissens e.V.
Eingetragen im Vereinsregister des Amtsgerichts Berlin-Charlottenburg
unter der Nummer 23855 B. Als gemeinnützig anerkannt durch das
Finanzamt für Körperschaften I Berlin, Steuernummer 27/681/51985.