1
0
Fork 0
Commit Graph

104 Commits

Author SHA1 Message Date
Jan Steemann 1d865cddb1 removed unnecessary long waits 2012-09-13 17:41:00 +02:00
Lucas Dohmen fbe85fcb40 Merge branch 'graph_algorithms' into devel
Conflicts:
	Makefile.in
	configure
2012-09-04 09:41:03 +02:00
Jan Steemann 4aaf066081 issue #185: increased wait time in test 2012-09-04 08:35:19 +02:00
Jan Steemann 035ca9c548 increased wait time 2012-09-03 17:42:55 +02:00
Jan Steemann 13f703c2c7 issue #184 2012-09-03 11:08:35 +02:00
Jan Steemann 6232ca74c7 changed unloading of collections to not wait in an endless loop if collection cannot be unloaded 2012-09-03 10:40:07 +02:00
Jan Steemann b8e7d5634d issue #153: edge collection should be a flag for a collection 2012-08-28 10:48:24 +02:00
Jan Steemann 105af56bf7 issue #110: support for partial updates 2012-08-21 15:17:51 +02:00
Lucas Dohmen 1699414168 Added two execution files for the comparison 2012-08-16 13:21:45 +02:00
Lucas Dohmen 472f279506 Added Payload Tests 2012-08-15 22:15:11 +02:00
Jan Steemann b29d303488 fixed sporadically failing test 2012-08-15 12:43:20 +02:00
Lucas Dohmen 5fa6eb8478 Some minor fixes. 2012-08-15 00:51:14 +02:00
Jan Steemann 396859e4fc added test case to trigger compaction 2012-08-14 11:52:50 +02:00
Frank Celler 69a8e64f9b Merge branch 'master' of github.com:triAGENS/ArangoDB into devel
Conflicts:
	.gitignore
	Makefile.in
	Makefile.local
	Makefile.unittests
2012-08-09 15:25:29 +02:00
Frank Celler 80b78a7415 added GC 2012-08-08 15:33:58 +02:00
Jan Steemann 982781ec3e reduced sleep intervals 2012-08-08 14:51:00 +02:00
Frank Celler 5027294e26 wait for collection to unload in unit-tests 2012-08-08 10:21:44 +02:00
Oreste Panaia 03cce62c3a bitarray index now support explicit values 2012-08-02 15:20:43 +08:00
Oreste Panaia 53e4fb7f12 Merge branch 'devel' of https://github.com/triAGENS/ArangoDB into devel
Conflicts:
	arangod/BitIndexes/bitarray.c
	arangod/BitIndexes/bitarrayIndex.c
2012-07-24 14:56:04 +08:00
Oreste Panaia cd5ed3ac67 added http support for bitarray idnex creation 2012-07-24 14:30:38 +08:00
Lucas Dohmen 0b0df398d0 First version of Measurements and Shortest Path Executor 2012-07-23 13:56:25 +02:00
Lucas Dohmen 00ae5bf344 Merge branch 'master' into graph_algorithms 2012-07-18 16:03:13 +02:00
Lucas Dohmen 463045e17c The pathTo method now supports graph-wide caching
This is the first step to support measurements. The data for the tests
has been added.
2012-07-18 16:00:17 +02:00
Lucas Dohmen 8861bd6410 Moved Graph tests to the correct file 2012-07-10 14:55:19 +02:00
Lucas Dohmen fb605e1247 Betweenness Measurement added to Vertices 2012-07-09 18:09:57 +02:00
Lucas Dohmen c6c9712f82 Added support for geodesics to Graph.js 2012-07-09 16:22:02 +02:00
Oreste Panaia 224614f14a Bitarray index fixes 2012-07-06 12:02:08 +08:00
Oreste Panaia 67d6b7fca0 Merge branch 'devel' of https://github.com/triAGENS/ArangoDB into devel 2012-07-05 13:59:46 +08:00
Oreste Panaia c72f44c949 Bitarray indexes update 2012-07-05 13:59:26 +08:00
Jan Steemann be6d64ced6 fixed unittest expectations after fix for issue #121 2012-07-04 12:32:09 +02:00
Oreste Panaia b84c9fefa9 Some bitarray index creation tests 2012-06-29 14:49:52 +08:00
Lucas Dohmen 07366afcfc Added two measurements to graphs
* diameter
* radius
2012-06-26 15:25:26 +02:00
Lucas Dohmen ecf09fc4dc Added distanceTo and two measurements to Vertices
The two measurements are:

* eccentricity
* closeness
2012-06-26 14:17:41 +02:00
Lucas Dohmen c6b2b2642c Added Degrees to Vertices, Size and Order to Graphs 2012-06-26 12:51:26 +02:00
Lucas Dohmen a7d3d50082 Linted graph.js and shell-graph-algorithms.js 2012-06-16 18:31:50 +02:00
Lucas Dohmen c129644fff Added a listed option to commonNeighbors and commonAttributes
If the listed option is given, instead of the number of attributes /
neighbors, the list of the names of the shared attributes / the IDs
of the shared neighbors are returned.
2012-06-16 18:26:41 +02:00
Lucas Dohmen edff65d5c8 Vertex#commonPropertieWith now also has a normalized variant 2012-06-16 18:05:14 +02:00
Lucas Dohmen b3620827d3 Added commonPropertiesWith to Vertex 2012-06-16 18:00:32 +02:00
Lucas Dohmen 2c70ce9291 Reorganization of functionality and tests for Graph.js 2012-06-16 17:38:27 +02:00
Lucas Dohmen c0a94a570b Added a commonNeighborsWith method to Vertex
Returns the number of common neighbors.
2012-06-16 14:58:48 +02:00
Lucas Dohmen 15b0a44aba Edge Exclusion for pathTo function
You can now exclude certain edges in your pathTo function with the
paramater `only` that expects a function that takes an edge as an
argument and returns true if and only if the edge should be used
for the path.

Use Case:
Only include edges on the path that have a rating of x or higher.
2012-06-16 14:26:26 +02:00
Lucas Dohmen 580813f006 Added Support for Weight Functions in pathTo
Instead of just selecting an attribute to get the weight of an edge,
the user can now formulate the computation of the weight of an edge
as a function that takes an edge as an argument and returns the weight.
This allows more flexible weights in the application.
2012-06-16 14:04:37 +02:00
Lucas Dohmen 46027601ac Merge branch 'devel' into graph_algorithms 2012-06-13 16:19:54 +02:00
Lucas Dohmen ad91d8cdfc The weighted pathTo now also takes a default weight
The default weight is needed, when an edge doesn't
have the specified weight attribute.
The default for this default value is `Infinity`.
2012-06-13 13:48:54 +02:00
Lucas Dohmen 7eddaa9259 Added support for weighted graphs to pathTo
The method `pathTo` now also accepts the following option:

* weight: The name of the attribute including the weight
2012-06-13 13:15:21 +02:00
Lucas Dohmen f11acff837 Enhanced pathTo for directed and labelled graphs
The `pathTo` method accepts an options hash.
Currently supported:

* direction: "both", "outbound", "inbound"
* labels: undefined or Array of Strings
2012-06-13 11:55:26 +02:00
Lucas Dohmen 104b28b607 Refactored the pathesForTree method
* It's now testable
* It's now in a better OO design
2012-06-12 15:25:06 +02:00
Lucas Dohmen 33732898ce Enhanced Vertex#getNeighbors
* getNeighbors now takes the following arguments:
  * direction: 'both', 'outbound' or 'inbound'
  * pathLabels: undefined or Array of Strings
2012-06-12 12:23:09 +02:00
Lucas Dohmen 020aa12c35 Dijkstra: Finds all shortest pathes now
* Previously only found one shortest path
* Returns the same results as Neo4j
2012-06-06 18:09:57 +02:00
Lucas Dohmen a41ff384ab Dijkstra finds pathes of correct length. 2012-06-06 14:57:57 +02:00