com.github.tmatek:zhang-shasha-java 1.0

A Java implementation of Zhang-Shasha algorithm for ordered tree distance calculation. Calculates a series of transformations required to transform one tree into another. Every transformation has an associated cost. The sum of costs of all transformations is minimal - the tree distance.

Categories	Java Languages
GroupId	com.github.tmatek
ArtifactId	zhang-shasha-java
Version	1.0
Type	jar

Download zhang-shasha-java 1.0

Filename	Size
zhang-shasha-java-1.0.pom
zhang-shasha-java-1.0.jar	17 KB
zhang-shasha-java-1.0-sources.jar	11 KB
zhang-shasha-java-1.0-javadoc.jar	51 KB

Apache Maven

<!-- https://jarcasting.com/artifacts/com.github.tmatek/zhang-shasha-java/ -->
<dependency>
    <groupId>com.github.tmatek</groupId>
    <artifactId>zhang-shasha-java</artifactId>
    <version>1.0</version>
</dependency>

Gradle Groovy

// https://jarcasting.com/artifacts/com.github.tmatek/zhang-shasha-java/
implementation 'com.github.tmatek:zhang-shasha-java:1.0'

Gradle Kotlin

// https://jarcasting.com/artifacts/com.github.tmatek/zhang-shasha-java/
implementation ("com.github.tmatek:zhang-shasha-java:1.0")

Apache Buildr

'com.github.tmatek:zhang-shasha-java:jar:1.0'

Apache Ivy

<dependency org="com.github.tmatek" name="zhang-shasha-java" rev="1.0">
  <artifact name="zhang-shasha-java" type="jar" />
</dependency>

Groovy Grape

@Grapes(
@Grab(group='com.github.tmatek', module='zhang-shasha-java', version='1.0')
)

Scala SBT

libraryDependencies += "com.github.tmatek" % "zhang-shasha-java" % "1.0"

Leiningen

[com.github.tmatek/zhang-shasha-java "1.0"]