psjava - Java Algorithm Library for Problem Solving

psjava is a collection of implementations of algorithms and data structures.

psjava is designed to provide flexibility and customizability. For example, you can choose heap implementation for Dijkstra's Algorithm. And also you can run it with a graph which has any weight number system, like 32bit integer or even BigInteger. See the detail in Dijkstra Algorithm Example

Download jar file or use maven. psjava requires Java 1.6 (or above)

```
<dependency>
<groupId>org.psjava</groupId>
<artifactId>psjava</artifactId>
<version>0.1.19</version>
</dependency>
```

Previous releases can be downloaded from here.

See some simple example : Dijkstra Algorithm, Memoization

Keyword |
---|

Array |

Binary Heap |

Disjoint Set |

Dynamic Array |

Intersection Of Two Sets |

Number System |

Queue |

Rooted Tree |

Segment Tree |

Segment Tree With Lazy Propagation |

Set |

Stack |

Trie |

The MIT License (MIT). See full version

Email : psjava.leader@gmail.com

Copyright 2014 psjava team. View on GitHub