commit | eb062b2b026decd7b8256bda44004b193ee9b4a5 | [log] [tgz] |
---|---|---|
author | zhoney <zhangyi51@baidu.com> | Wed Nov 25 19:08:44 2020 +0800 |
committer | GitHub <noreply@github.com> | Wed Nov 25 19:08:44 2020 +0800 |
tree | 04147dbf63da3966d87ba351135db4ca27fe7317 | |
parent | 9bc985c0673374d1167f0149c7345c7f6549ff25 [diff] |
fix weighted shortest path result not stable (#1280) Change-Id: Ic97d8c92bd97d6203b7b366a2c6e2f661932e05f
HugeGraph is a fast-speed and highly-scalable graph database. Billions of vertices and edges can be easily stored into and queried from HugeGraph due to its excellent OLTP ability. As compliance to Apache TinkerPop 3 framework, various complicated graph queries can be accomplished through Gremlin(a powerful graph traversal language).
The project homepage contains more information on HugeGraph and provides links to documentation, getting-started guides and release downloads.
Welcome to contribute to HugeGraph, please see How to Contribute
for more information.
HugeGraph is licensed under Apache 2.0 License.
HugeGraph relies on the TinkerPop framework, we refer to the storage structure of Titan and the schema definition of DataStax. Thanks to TinkerPop, thanks to Titan, thanks to DataStax. Thanks to all other organizations or authors who contributed to the project.
You are welcome to contribute to HugeGraph, and we are looking forward to working with you to build an excellent open source community.