Traumwind - next possible step

on my way to total Google-Graph-browsing nirvana: Have a search that uses the accumulated data (cache) and find out how many steps apart two given URLs might be. One problem I see here is that I can only fetch the top 10 related URLs for each URL, but maybe that is also a way of filtering... (ok, I _can_ fetch more than 10, but I really don't want to go into that. The automatic filtering these top 10 URLs give I'm rather happy with)

[ by Martin>] [permalink] [similar entries]

similar entries (vs):

Google relations - two levels deep (# 14%)
members only - no more! (# 14%)
minor update (# 13%)
Very Nice! (# 10%)

similar entries (cg):

Jeff (# 6%)
RSS auto-discovery bookmarklet (# 6%)
need to build URLs with encoded paramters in XSLT? (# 5%)
members only - no more! (# 3%)
O'Reilly Network: Google's Genius (# 3%)
CityDesk Starter Edition (# 3%)
Google relations - two levels deep (# 2%)

relevant words

Martin Spernau
© 1994-2003

Big things to come (TM) 30th Dez 2002

Once the search is in progress, something will be found
Oblique Strategies, Ed.3 Brian Eno and Peter Schmidt

amazon.de Wunschliste

usefull links:
Google Graph browser
Traumwind 6-Colormatch
UAV News

urls (3.7)
top (3.4)
fetch (3.4)
filtering (3.2)
i (2.5)
that (2.4)
way (2.3)
nirvana (2.2)
accumulated (2.2)
steps (2)
automatic (2)
cache (2)
http://traumwind.tierpfad.de/soap/ (2)
can (1.9)
but (1.9)
the (1.9)
give (1.9)
step (1.8)
total (1.8)
url (1.7)
related (1.7)
happy (1.7)
apart (1.7)
traumwind.tierpfad.de (1.7)
is (1.7)
many (1.6)
possible (1.6)
given (1.6)
data (1.6)
these (1.6)
each (1.6)
ok (1.6)
two (1.6)
next (1.6)
uses (1.6)
problem (1.6)
a (1.5)
google (1.5)
rather (1.5)
want (1.5)
maybe (1.5)
to (1.5)
search (1.5)
than (1.5)
go (1.5)
how (1.4)
see (1.4)
out (1.4)
into (1.4)
find (1.4)
really (1.4)
might (1.3)
don (1.3)
more (1.3)
also (1.3)
here (1.3)
only (1.3)
have (1.1)
one (1.1)
my (1.1)
be (1.1)
with (1)
on (1)
for (0.9)
of (0.9)
and (0.9)
martin (0.7)
(0)