Hi,
I think you should use graph viewers like jung.
On Wed, Sep 28, 2011 at 11:50 PM, tt6 wrote:
>
> Hello,
> I have stored triples into the Neo4J embedded db, now I want to see the
> graph or data in the db. How can I do it?
>
> Thanks,
>
> --
> View this message in context:
> http://neo4j-comm
party.
>
>
>
> 2011/9/20 Николай Ижиков :
> > 11.09.2011 9:26 пользователь "Reza Ameri" написал:
> >
> > Hi,
> > I was trying to install and start Neo4j 1.41 on my Vista 32bit System, it
> is
> > installed but not starts!
> > T
HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Mon, Sep 19, 2011 at 5:48 PM, Reza Ameri wrote:
> > It is solved now! just a childish mistake!!
> > Thank you.
> >
> > On Mon, Sep 19, 2011 at 1:22 PM, Peter Neubauer
://www.neo4j.org - Your high performance graph database.
> http://startupbootcamp.org/- Öresund - Innovation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Mon, Sep 19, 2011 at 7:53 AM, Reza Ameri wrote:
&g
; http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Tue, Sep 13, 2011 at 12:48 PM, Reza Ameri wrote:
> > Hi Peter,
> > It is great! thank you.
> >
> > On Tue, Sep 13, 2011 at 3:06 PM, Peter Neubauer <
> > peter.neuba...@neo
Hi,
Thank you, it solved my problem very well.
Thanks.
On Sat, Sep 17, 2011 at 8:16 PM, Peter Neubauer <
peter.neuba...@neotechnology.com> wrote:
> Thanks for the pointers Daniel, feel free to fork
> https://github.com/neo4j/community/tree/master/graph-algo and try
> stuff out together with Reza
rmance graph database.
> http://startupbootcamp.org/- Öresund - Innovation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
>
> On Sun, Sep 11, 2011 at 7:26 AM, Reza Ameri wrote:
> > Hi,
> > I was trying to install and st
Hi,
I was trying to install and start Neo4j 1.41 on my Vista 32bit System, it is
installed but not starts!
The error is
"[SC] StartService FAILED 1053:
The service did not respond to the start or control request in a timely
fashion."
Any Idea? It is right that I work on it slowly but the fact is a
> GTalk: neubauer.peter
> Skype peter.neubauer
> Phone +46 704 106975
> LinkedIn http://www.linkedin.com/in/neubauer
> Twitter http://twitter.com/peterneubauer
>
> http://www.neo4j.org - Your high performance graph database.
> http://s
novation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
> On Tue, Aug 30, 2011 at 11:32 AM, Reza Ameri wrote:
>
> > Great!
> > I have Dell Vostro 1510,
> > Processor Intel core2Due 2500 (2CPUs)
> > 3.00 GB of Ram
>
>
> Check Point: 900
>
>
> and it took 198s. Not sure what is the problem here, what are you running
> on
> in terms of OS and JVM?
>
>
> /peter
>
> On Tue, Aug 30, 2011 at 11:10 AM, Reza Ameri wrote:
>
> > Thank you for your quick answer, m
twitter.com/peterneubauer
>
> http://www.neo4j.org - Your high performance graph database.
> http://startupbootcamp.org/- Öresund - Innovation happens HERE.
> http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.
>
>
> On Tue, Aug 30, 2011 at 10:57 AM, Reza
Hi,
I've written the code below to create 10M nodes, without any relations. But,
it has memory exception that couldn't solve. would you please help me.
Also I want to show this graph visually. I used Gremlin and Jung to view the
graph, but it either did not work even for 1M nodes! Any Idea About t
really got the time to look more into it a.t.m. but keep us posted
> on progress!
>
> 2011/8/9 Reza Ameri
>
> > Thanks, I am working on it for days. Do you think it is easy to return
> > next-best path?
> > I will work on this code and any inform you and all the
le looking at/modifying java
> source? If that's the case then look at
>
> https://github.com/neo4j/community/blob/master/graph-algo/src/main/java/org/neo4j/graphalgo/impl/path/AStar.javawhich
> is a quite straight forward implementation of the a-star algorithm.
>
> Best,
> Matti
're happy using Neo4j!
>
> By low weighted paths do you mean the Dijkstra algorithm, where each
> relationship is associated with a cost and you'd like to find the cheapest
> paths? In that case try GraphAlgoFactory#dijkstra
>
> 2011/8/8 Reza Ameri
>
> > Hi eve
the normal java
> API or if it is really large (100M+ nodes and rels) then use the
> Batch-Inserter-API for that.
> >
> > Then you implement your use-cases on top of your domain model and test
> and verify them on a small graph and performance test them on the large,
> genera
Hi,
How can I test my application that uses Neo4j?
I can not find a huge sample graph to test my app with it. Is there any one
that can help me???
Thank you all
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Hi every one,
I'm really new to Neo4j and really shocked of this big and useful DBMS that
seems to solve any problem that I have!
after working on the neo4j in my java application, I could finally create an
astar traverse, which is really cool! But there is one other need, how can I
find top (n) lo
19 matches
Mail list logo