Very cool Max!
WDYT about adding a node and relationship representation other than
the response body to the return values? I would love to do this:
require 'rubygems'
require neography
@neo = Neography::Rest.new()
max = @neo.create_node(age = 31, name = Max)
puts max
peter =
I've done some stuff regarding this:
- Added similarity configuration parameter (although not very tested
since I don't really know how lucene similarity works).
- Added QueryContext#topDocs(int) which you can set so that only top N
hits are retrieved instead of all (may or may not
Hello all,
I have successfully imported a large part of my data set into neo4j and
have done some basic traversals. I want to start visualizing a portion of
the graph or of a traversal and was overwhelmed by the amount of options
listed at
Venkat,
Looks cool! Do you have any special purpose with that visualization,
like many edges, or a special domain?
Also, I have updated the visualization wiki page with some more
options. Generally, it seems JavaScript based libs are nice but not
there performance wise. Secondly, the choice is
I implemented it for mining network graphs, but I think it works for many
domains.
Here are the features I focused:
- Since my networks are large, it does not need to load the whole network
into memory to identify a node location in the layout.
- node,edge names can be selective.
- Final visual
Very cool,
that was fast turnaround! It seems if the node[data][age] and
@neo.get_id(node) methods move to the nodes themselves, the whole
things looks almost identical to the native API, as Andreas is
noticing,
node[age]
node.id
I'm always amazed by how little code there is in Ruby. Grmpf.
result filter? shouldn't that be return filter or was that not a
copy and paste?
On Sun, Nov 21, 2010 at 11:34 PM, Anees Haider an...@justlynx.com wrote:
Hi all,
I want to write an prune evaluator for neo4j-rest, such that we have a node
type N (having property p set to value v, i.e.
Thanks Max, It is now at least full filling some of the requirements. Now
the only limitation I am having is that I am only getting close nodes i.e. I
-- J -- K (nodes at most 2 hops away) not nodes further away (more than 2
hops away) such as I -- A -- B -- C -- K, (please note I and K are
8 matches
Mail list logo
