Directed Graph Algorithms

A straight forward Graph class with Nodes that support custom Marks.

License

License

GroupId

GroupId

com.github.t1
ArtifactId

ArtifactId

graph
Last Version

Last Version

1.0.3
Release Date

Release Date

Type

Type

jar
Description

Description

Directed Graph Algorithms
A straight forward Graph class with Nodes that support custom Marks.
Project URL

Project URL

https://github.com/t1/graph
Source Code Management

Source Code Management

https://github.com/t1/graph

Download graph

How to add to project

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

Dependencies

compile (1)

Group / Artifact Type Version
org.assertj : assertj-core Optional jar 3.2.0

provided (1)

Group / Artifact Type Version
org.projectlombok : lombok Optional jar 1.16.6

test (1)

Group / Artifact Type Version
junit : junit jar 4.13.1

Project Modules

There are no modules declared in this project.

Graph latest-version Build Status

A straight forward Graph class with Nodes that support custom Marks.

The most interesting part is the Graph#topologicalSort() method, which uses Tarjan's Strongly Connected Components Algorithm, so it can report exactly which cycles where found.

Versions

Version
1.0.3