Hi John,
One option could be to model the graph with 2 identical spatial layers and
add walking relationships between the layers.
Similar to the attached pic, its from http://bit.ly/hJN2BB and then only one
walking relationship could be traversed.
Cheers
Paddy
On Mon, Apr 11, 2011 at 7:50 AM
?
Cheers
Paddy
On Mon, Apr 11, 2011 at 2:45 PM, Mattias Persson
matt...@neotechnology.comwrote:
Hi Paddy,
how would that help in decision-making of which route is the
shortest when also taking into considering the amount of transfers?
2011/4/11 Paddy paddyf...@gmail.com:
Hi John,
One option
();
Direction[] directions; // All are Direction.OUTGOING
RelationshipExpander rel = Traversal.expanderForTypes( types, directions);
Thanks
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Pad
On Thu, Mar 10, 2011 at 6:43 PM, Paddy paddyf...@gmail.com wrote:
Hi,
How could I populate a RelationshipExpander directly with
RelationshipType[] Direction[] propertys.
As the Traversal.expanderForTypes takes varargs, How can I do something
along the lines of below or should I implement
Hi Saikat,
I have come across this problem too. If its possible to define the
relationships between
the nodes as a Train, Bus or Walking relationship. You could use a
RelationshipExpander
to define which relationship types you wish to Traverse when using the
findAllPaths.
Regards,
Paddy
On Fri
Hi Saikat,
I'm glad you like it, it would be great to compare approaches.
I'll try to create some example code of transit routing with time and using
transfer patterns over the weekend.
Cheers,
Paddy
On Fri, Feb 4, 2011 at 1:37 PM, Saikat Kanjilal sxk1...@hotmail.com wrote:
Hi Paddy,I've
and build a new neo4j graph in one Reducer.
Regards,
Paddy
On Mon, Jan 31, 2011 at 8:43 AM, Saikat Kanjilal sxk1...@hotmail.comwrote:
John,If you havent already take a look at some of the algorithms in mahout,
they are currently using hadoop (http://mahout.apache.org) and it may be
the case
database back
to s3 or
even access an EBS volume directly if possible.
Please let me know any suggestions on how to improve or speed it up.
cheers,
Paddy
On Sun, Jan 2, 2011 at 12:44 AM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Very cool!
Is this part of the GITHub setup? And, are you
] error for some
jobs.
Just tested running Neo4j graph-algo parallel on 20 machines, sweet :)
cheers,
Paddy
On Sat, Nov 27, 2010 at 4:16 PM, Paddy paddyf...@gmail.com wrote:
Hi,
I'm a very much a Hadoop newbie but I think that would be very possible,
maybe even making use of: http
org.apache.hadoop.io.Writable, be a good method to serialize and
deserialize Neo4j objects between jobs?
http://developer.yahoo.com/hadoop/tutorial/module5.html#types
It would also be interesting to chain multiple traversals as Map-Reduce
jobs.
cheers
Paddy
On Fri, Nov 26, 2010 at 9:00 AM, Peter Neubauer
://yourbucket.s3.amazonaws.com/neo-db.tar.gz
sudo tar -C /home/hadoop -xzf neo-db.tar.gz
sudo chmod -R 777 /home/hadoop/neo-db
Does this sound like the best method to use?
cheers
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org
= indexProvider.nodeIndex(persons,
MapUtil.stringMap(type,exact,
provider, lucene));
It will be fixed in M03, where the LuceneBatchInserterIndexProvider fills
that in for you.
2010/10/26 Peter Neubauer peter.neuba...@neotechnology.com
Paddy,
just tested it, and it seems it only occurs when running
in
IndexManagerImpl
is returning a null value.
Or please let me know if I should be doing this a different way.
thanks
Paddy
public class BatchIndexTest {
static final String DB_PATH = data/neo-db-test10;
static BatchInserterIndexProvider indexProvider;
static BatchInserter inserter;
static
to
construct the directed acyclic graph's.
I was thinking maybe the PatternMatcher might be a good way to construct the
dag from the transfer patterns?
cheers
Paddy
On Tue, Oct 19, 2010 at 10:04 AM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Paddy,
are you planning to implement
graph to
tables, Not sure if there an algorigthm to construct a directed acyclic
graph?
Paddy
On Sat, Oct 16, 2010 at 10:57 PM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Paddy,
I am experimenting with connecting train routes to stations. Would
your case be something similar? My
to
approach this.
Thanks
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Hi Andreas,
Yes it looks like you don't need to wrap it in a padded string.
I tried using myIndex.add(ndOne, time,1f); it will stills work.
thanks
Paddy
On Thu, Sep 23, 2010 at 12:37 AM, Andreas Ronge andreas.ro...@jayway.sewrote:
Hi Paddy
Thanks for the response.
But it would be nice
to include in the CLASSPATH to insert and
index nodes using the BatchInserter,
which are then compatible to be queried using the new LuceneIndexProvider ?
thanks
Paddy
On Thu, Sep 23, 2010 at 4:45 PM, Mattias Persson
matt...@neotechnology.comwrote:
Your code doesn't use the new index framework
down the right path :-/
thanks
Paddy
On Sat, Sep 11, 2010 at 1:51 PM, Paddy paddyf...@gmail.com wrote:
Hi David,
Thanks for your help, I got it working using the following code. I tested
it on a small graph with the neo4j java-dijkstra example and it works :)
Cheers
Paddy
public static
this the
wrong way?
thanks
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Hi Alex,
Yes neo4j and lucene is confusing to start but it is very good when combined.:
) It would be good to see if it could integrated, elasticsearch sounds good
Thanks
Paddy
On 5 Sep 2010, at 02:14, Alexandru Popescu
☀the.mindstorm.mailingl...@gmail.com wrote:
On Saturday, September 4
/Getting_Started_Guide#If_you_use_Maven
http://blog.neo4j.org/2010/04/neo4j-rest-server-part1-get-it-going.html
Paddy
2010/9/5 Alexandru Popescu ☀ the.mindstorm.mailingl...@gmail.com
2010/9/6 Alexandru Popescu ☀ the.mindstorm.mailingl...@gmail.com:
Still on the neo4j-rest component. Is this the correct SVN
to investigate further?
Thanks
Paddy
On Thu, Aug 26, 2010 at 8:41 AM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Very cool Paddy!
I have been talking to Craig about this - we are thinking that, with
knowing a lot of information about your bus stops, there should be a
lot
to try answer your questions
better, as i'm not sure which approach to take.
On Fri, Aug 27, 2010 at 2:43 PM, Michael Miller m...@cloudant.com wrote:
Hi Paddy,
Sorry to be so slow on my reply, insane travel week for me! Just got back
from North Carolina, and I can say that the deep south
Instances HVM CentOS 5.4 (AMI Id: ami-7ea24a17)
Minimal CentOS 5.4, 64-bit architecture, and HVM-based virtualization for
use with Amazon EC2 Cluster Instances.
More info here:
http://www.allthingsdistributed.com/2010/07/cluster_compute_instance_amazon_ec2.html
Cheers
Paddy
On Wed, Aug 25, 2010 at 3
(),
end.getUnderlyingNode());
weight = path.weight();
}
long endTimer = System.currentTimeMillis();
System.out.println(Dijkstra Time:: + (endTimer - startTimer)
+ milliseconds);
}
}
WDYT? I would appreciate any help!
Cheers,
Paddy
On Tue, Aug 24, 2010 at 12:14 AM, Peter
is a good read
http://labs.google.com/papers/mapreduce-osdi04.pdf
Thanks
Paddy
On Thu, Aug 19, 2010 at 11:17 PM, Peter Neubauer
peter.neuba...@jayway.comwrote:
Paddy,
depending on your traffic and security setup, either you can directly
expose Tomcat/Jetty/Grizzly etc on port 80, or put Apache
AM, Anders Nawroth and...@neotechnology.comwrote:
For reference, there's a Stackoverflow thread on this topic as well:
http://stackoverflow.com/questions/3466437/
An answer has been posted today, but I didn't try it out though.
/anders
On 07/15/2010 01:28 PM, Paddy wrote:
hi all,
I would
been done in this field, this describes a A* algorithm
with landmarks:
: http://www.optimization-online.org/DB_HTML/2008/11/2154.html
Also the Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public
Railroad Transport paper also looks good
cheers
Paddy
On Fri, Aug 13, 2010 at 10:06
)
at org.neo4j.gis.spatial.DefaultLayer.makeLayer(DefaultLayer.java:248)
at org.neo4j.gis.spatial.DefaultLayer.makeLayer(DefaultLayer.java:240)
... 3 more
Cheers
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
this will speed up the
path finding and as it can take 5-10 seconds for long routes with the
current graph.
I will let you know
Cheers
Paddy
On Thu, Aug 12, 2010 at 11:27 PM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Glad you solved it!
Btw, is the site now officially online?
Cheers
Hi,
so I just needed to use :) :
LuceneFulltextIndexBatchInserter index = new
LuceneFulltextIndexBatchInserter( inserter );
Good batch insert example @
https://svn.neo4j.org/components/index/trunk/src/test/java/org/neo4j/index/lucene/TestBatchInsert.java
Paddy
On Wed, Aug 11, 2010 at 8:47 PM
for the LuceneIndexBatchInserter but not
for LuceneFulltextIndexBatchInserter
LuceneIndexBatchInserter indexService = new LuceneIndexBatchInserterImpl(
inserter );
thanks
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
simultanous requests?
Thanks
Paddy
On Tue, Jul 27, 2010 at 7:02 AM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Paddy,
I took the freedom to format the wiki a bit and put a maven profile
into the pom.xml in order to download and expand the data
automatically if you run
mvn -P import
:8080/transportdublin/routeplanner
8. Click on two locations on the map to generate a route
Thanks
Paddy
On Fri, Jul 23, 2010 at 4:53 PM, Paddy paddyf...@gmail.com wrote:
Hi,
I have updated the wiki with screen shots and information
http://wiki.github.com/paddydub/TransportDublin/
and I
next on implementing the BatchInserter next to speed up the
graph setup process
Thanks
Paddy
On Wed, Jul 21, 2010 at 3:26 PM, Anders Nawroth and...@neotechnology.comwrote:
Hi Paddy!
Some interesting stuff you're working on there!
I'd like to write a bit about the differences in neo4j
and sql and why
neo4j it is a perfect solution for route planning systems, do you think a
wiki would be the best option to display the pics? I will be uploading the
code today and tomorrow, just making some last minute changes and writing
some documentation.
Cheers
Paddy
Hi
I didn't get a chance to finish re-factoring the project today, i will have
it ready Tuesday as I'd like to write some documentation as well and make
the code cleaner
Thanks
Paddy
On Thu, Jul 15, 2010 at 11:38 PM, Peter Neubauer
peter.neuba...@neotechnology.com wrote:
Paddy,
great, we
hi,
Thanks for the advice, Would it be better to use Amazon S3 or EBS storage to
mount the neo4j database?
thanks
Paddy
On Thu, Jul 8, 2010 at 6:24 AM, Dave butlerdi butle...@gmail.com wrote:
We have just started putting the NK stuff together as they recently moved
to
V4 and it is quite
=/home/neo/var/neo4j-db/
/bean
and auto-wired using the @Autowired annotation:
@Autowired
private GraphDatabaseService graphDbService;
Thanks a lot
Paddy
On Sat, Jul 10, 2010 at 3:38 PM, Paddy paddyf...@gmail.com wrote:
hi,
Thanks for the advice, Would it be better to use Amazon S3 or EBS
://wiki.neo4j.org/content/Neo4j_in_the_Cloud
3. deploy the war file to jetty
http://www.enavigo.com/2008/08/29/deploying-a-web-application-to-jetty
Thanks,
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
sorry should of seen that, thanks for your help
Paddy
On Wed, Jun 30, 2010 at 4:27 AM, Mattias Persson
matt...@neotechnology.comwrote:
As the example states you must use the LuceneFulltextQueryIndexService (not
the LuceneFulltextIndexService)!
2010/6/30 Paddy paddyf...@gmail.com
I have
( RelationshipTypes.ROAD, Direction.BOTH );
AStar sp = new AStar( graphDb, relExpander, costEval, estimateEval );
Path path = sp.findSinglePath( NYC.getUnderlyingNode(),
SF.getUnderlyingNode() );
thanks
Paddy
___
Neo4j mailing list
User@lists.neo4j.org
information
in your graph.
A cool use of A*, I might add.
2010/6/9 Paddy paddyf...@gmail.com:
I have nodes representing bus stops, and relations representing bus
connections with cost values representing minutes it takes for the bus to
reach each stop.
I'm currently using the A Star algorithm
factor.
As I would prefer not to insert any data into the graph when calculating the
route so it is read only.
I would also add timetable data to find the shortest route time and also
fare cost information at a later date.
I would appreciate any help, thanks
Paddy
On Sat, Jun 5, 2010 at 12:09 PM
I have nodes representing bus stops, and relations representing bus
connections with cost values representing minutes it takes for the bus to
reach each stop.
I'm currently using the A Star algorithm to find the quickest route for the
bus routes.
what is the best way to integrate the timetable
I would like to store coordinates as nodes in neo4j to do simple querys
For example a list of 10,000 nodes:
Node[1] - lon=-74.007124, lat=40.714550
Node[2] - lon=-94.626824, lat=39.113380
Node[3] - lon=-105.937406, lat=35.691543
Node[4] - lon=-122.329439,
47 matches
Mail list logo