https://github.com/andrewnester/algorithms-ii

Algorithms written on Java
https://github.com/andrewnester/algorithms-ii

algorithm directed-graphs edge-weighted-graphs graph java

Last synced: 4 months ago
JSON representation

Algorithms written on Java

• Host: GitHub
• URL: https://github.com/andrewnester/algorithms-ii
• Owner: andrewnester
• Created: 2015-11-01T19:52:01.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2015-11-17T09:19:13.000Z (about 10 years ago)
• Last Synced: 2023-02-27T02:32:13.549Z (almost 3 years ago)
• Topics: algorithm, directed-graphs, edge-weighted-graphs, graph, java
• Language: Java
• Homepage:
• Size: 67.4 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 3
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
[![Build Status](https://travis-ci.org/andrewnester/algorithms-ii.svg?branch=master)](https://travis-ci.org/andrewnester/algorithms-ii) [![Coverage Status](https://coveralls.io/repos/andrewnester/algorithms-ii/badge.svg?branch=master&service=github)](https://coveralls.io/github/andrewnester/algorithms-ii?branch=master)

# Algorithms

Algorithms written on Java

Based on http://algs4.cs.princeton.edu/home/

### Structures

* Graph

* Directed Graph

* Edge-weighted graphs

* Index Priority Queue

### Algorithms

#### Basic

 * Union Find

#### Graphs Algorithms

* Graphs (common)

  * Deep-first search

  * Breadth-first search

* Directed Graphs

  * Cycle detection algorithm (for edge-weighted graphs too) 

  * Deep-first order

  * Topological sort

  * Kosaraju - Sharir algorithm

  * Dijkstra algorithm

  * Bellmann - Ford algorithm

* Undirected Graphs

  * Connected components (based on Deep-first search)

  * Kruskal Algorithm for Minimum Spanning Tree

  * Prim's algorithm (both lazy and eager implementations)