Hawkin
/
arangodb
mirror of https://gitee.com/bigwinds/arangodb
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
3,295 Commits 358 Branches 495 Tags 994 MiB
Commit Graph

74 Commits

Author SHA1 Message Date
a-brandt b800f2652c renamed "blueprint" to "blueprints" and added documentation and tests 2012-10-30 13:35:36 +01:00
Frank Celler 59ef60d6b2 fixed doc errors 2012-10-12 19:21:52 +02:00
Lucas Dohmen 06fb38ca20 Requiring Graph.js automatically requires monkeypatches 
The user should not have to do that manually.
Makes no sense.
 2012-09-26 14:18:24 +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 1167b62ca6 issue #153: wrote upgrade script for arango. this will convert collections into edge collections etc. 2012-08-28 17:29:36 +02:00
Jan Steemann b8e7d5634d issue #153: edge collection should be a flag for a collection 2012-08-28 10:48:24 +02:00
Lucas Dohmen 5fa6eb8478 Some minor fixes. 2012-08-15 00:51:14 +02:00
Lucas Dohmen 353b28d814 Faster Handling of shortest path if empty 2012-08-06 16:07:12 +02:00
Lucas Dohmen 0b0df398d0 First version of Measurements and Shortest Path Executor 2012-07-23 13:56:25 +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 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
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 ac092872ee Refactoring on Graph.js 
All methods reviewed and refactored. The refactorings use the new
ECMA Script 5 methods which are more efficient and precise.
 2012-06-24 09:30:30 +02:00
Lucas Dohmen 2745997ad8 Re-Did the optimizations of the monkeypatches 2012-06-20 17:01:14 +02:00
Lucas Dohmen 15eddecc34 Revert "Monkeypatches have their own module now." 
This reverts commit d01b16a930cfc5a47174d7e24a1742c20f874318.

Conflicts:
	js/common/modules/monkeypatches.js
 2012-06-20 16:43:08 +02:00
Lucas Dohmen 455befdbf6 Monkeypatches loaded by default and refactored 
The monkeypatches will now always be loaded a server startup.
I also refactored them.
 2012-06-20 16:18:04 +02:00
Lucas Dohmen a31d5e8f27 Monkeypatches have their own module now. 2012-06-20 15:14:48 +02:00
Lucas Dohmen bfa2e09ee6 All "Monkey Patches" now use Object.defineProperty 2012-06-20 14:12: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 e41291c44d Tiny improvement: forEach instead of for 2012-06-13 16:11:26 +02:00
Lucas Dohmen aa17edce23 Refactored Vertex#getNeighbors 2012-06-13 14:01:48 +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 70ae8d84d4 Small Refactoring for pathesForTree 2012-06-12 15:38:19 +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 e3a3e5f857 Heavy refactoring of the methods for Dijkstra 2012-06-12 13:24:25 +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 ea13cfac51 Renamed all occurrences of node to vertex... 2012-06-06 19:14:21 +02:00
Lucas Dohmen 933bc293b6 Added documentation for all pathTo helper functions 2012-06-06 19:11:53 +02:00
Lucas Dohmen 0433236c8b Graph.js: Lint-Free 2012-06-06 18:49:43 +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
Lucas Dohmen a1cf1017c5 Passes the Neo4j 500 Length Test now. 2012-05-25 15:25:13 +02:00
Lucas Dohmen 4dd0306d0a Added the Random 500 Test and fixed a bug 2012-05-23 16:21:34 +02:00
Lucas Dohmen dd5307de29 Dijkstra, Version 1 2012-05-16 16:25:07 +02:00
Lucas Dohmen ff0ecc0b76 ... and its implementation 2012-05-13 21:00:53 +02:00
Frank Celler 763e7aba98 renamed to Arango 2012-05-12 14:40:34 +02:00
Frank Celler 3770c30684 doc 2012-04-28 21:25:07 +02:00
Frank Celler 3f413a39b1 doc 2012-04-28 21:20:15 +02:00