> I can find all paths between A-M for attached image graph , now how can I add a filter condition to Relationship where value<=200. Below is my snippet for finding all paths:

> PathFinder<Path> finder = GraphAlgoFactory.allPaths(Traversal.expanderForTypes(relType.CONNECTED, Direction.BOTH),100);
> Iterable<Path> paths = finder.findAllPaths(A, M);

> Iterator<Path> pIterator = paths.iterator();
> while (pIterator.hasNext()){
>  Path path = pIterator.next();
>  System.out.println(Traversal.simplePathToString(path));
> }

> best regards,

> Rehan

> On Sunday, 23 September 2012 23:02:46 UTC+8, Rehan wrote:
> Hi Micheal,

> please see the attached for implementation of example graph but I am getting an exception on Cypher query:

> expected where
> "start n=node(1),m=node(13) match p=allShortestPaths(n-[*]-m) where all(r in rels(p) :  r.value>=200) return p "
>                                                                                                                                     ^
>    at org.neo4j.cypher.internal.parser.v1_8.CypherParserImpl.parse(CypherParserIm pl.scala:44)
>    at org.neo4j.cypher.CypherParser.parse(CypherParser.scala:44)
>    at org.neo4j.cypher.ExecutionEngine$$anonfun$prepare$1.apply(ExecutionEngine.s cala:61)
>    at org.neo4j.cypher.ExecutionEngine$$anonfun$prepare$1.apply(ExecutionEngine.s cala:61)
>    at org.neo4j.cypher.internal.LRUCache.getOrElseUpdate(LRUCache.scala:31)
>    at org.neo4j.cypher.ExecutionEngine.prepare(ExecutionEngine.scala:61)
>    at org.neo4j.cypher.ExecutionEngine.execute(ExecutionEngine.scala:55)
>    at org.neo4j.cypher.ExecutionEngine.execute(ExecutionEngine.scala:52)
>    at com.fastwire.carriere.grpah.GaphGeneratorImplTest.initializeGraphDB(GaphGen eratorImplTest.java:95)

> Any idea how can I resole this issue.

> Thanks in advance.

> best regards,

> Rehan

> On Sunday, 23 September 2012 18:28:21 UTC+8, Michael Hunger wrote:
> Cool, please share your results

> Please use cypher parameters for query caching.

> Aka n=node({startNode})
> Etc

> Sent from mobile device

> Am 23.09.2012 um 06:38 schrieb Rehan <rehan...@gmail.com>:

>> this is dynamic data, but every time we will refresh the whole database . Our goal  is to find the shortest paths keeping in mind efficiency while filtering those based on given properties.

>> On Sunday, 23 September 2012 04:51:57 UTC+8, Niels Hoogeveen wrote:
>> The data you are using, is that static or does it change over time? If you need update facilities, then having a graph database is certainly not overkill (ACID properties). If however you have a never changing set of 3000 nodes, you may as well load them from a text file into datastructures of your own.

>> On Saturday, September 22, 2012 4:00:27 PM UTC+2, Rehan wrote:
>> Hi

>> I have a very basic Graph requirement ,  as show in  attached example image.

>> I have few questions here:
>> is Neo4J not an over kill for this purpose? as I have nodes less that 3000.
>> do Neo4J supports finding short test path between two given nodes while specifying criteria for a property of relationship to be met.  if yes can someone give a java example for this.
>> Would be great help if some one can illustrate a a small java class for attached graph as an example.

>> Thanks in advance.

>> Rehan

>> --

> --