DaedaFusion Graph

A graph routing algorithm library

License

License

GroupId

GroupId

com.daedafusion
ArtifactId

ArtifactId

graph
Last Version

Last Version

1.0
Release Date

Release Date

Type

Type

jar
Description

Description

DaedaFusion Graph
A graph routing algorithm library
Project URL

Project URL

http://daedafusion.com
Source Code Management

Source Code Management

https://github.com/daedafusion/graph.git

Download graph

How to add to project

<!-- https://jarcasting.com/artifacts/com.daedafusion/graph/ -->
<dependency>
    <groupId>com.daedafusion</groupId>
    <artifactId>graph</artifactId>
    <version>1.0</version>
</dependency>
// https://jarcasting.com/artifacts/com.daedafusion/graph/
implementation 'com.daedafusion:graph:1.0'
// https://jarcasting.com/artifacts/com.daedafusion/graph/
implementation ("com.daedafusion:graph:1.0")
'com.daedafusion:graph:jar:1.0'
<dependency org="com.daedafusion" name="graph" rev="1.0">
  <artifact name="graph" type="jar" />
</dependency>
@Grapes(
@Grab(group='com.daedafusion', module='graph', version='1.0')
)
libraryDependencies += "com.daedafusion" % "graph" % "1.0"
[com.daedafusion/graph "1.0"]

Dependencies

compile (3)

Group / Artifact Type Version
com.google.guava : guava jar 18.0
net.sf.trove4j : trove4j jar 3.0.3
log4j : log4j jar 1.2.17

test (1)

Group / Artifact Type Version
junit : junit jar 4.12

Project Modules

There are no modules declared in this project.

Build Status

Coverage Status

graph

Graph Algorithms (AStar, Dijkstra) adapted from Graphhopper (https://github.com/graphhopper/graphhopper/)

about

This port of the graphhopper library changes the definition of a node and edge identifiers from an int to a long.

Additionally, the infrastructure tying the implementation to the OSM file definition has been removed so that the base algorithms can be used independently. The routing algorithms can now be used with Jena and other onotology engines.

com.daedafusion

DaedaFusion

Versions

Version
1.0