List of Free code Graph Algorithm
Projects

CS 510 Cassandra
Graph algorithms implemented for Cassandra.

eclipse graph tools
Visualization of basic graph algorithms for Eclipse IDE.

furnace
A Property Graph Algorithms Package.

geolatte graph
A library for graph algorithms (shortest path, spanning tree,...).

graph algorithm
pagerank,hits and so on.

Graph Algorithms
Data Structure for Graph and a few graph algorithms.

Graph AlgorithmTool
a graph tool that implements various graph algorithms.

Graph GA
Genetic Algorithms for minimum crossing number Graph Embedding.

Graph Handler
A university project in java for the course "Introduction to Algorithms" that can be used for displaying graphs , calculating their strongly connected components and running the Kruskal Algorithm to find out the shortest path to all nodes.

Graph MST
Minimum/Maximum Spanning Tree (MST) algorithm for directed and undirected graphs.

Graph Network
A Java Swing applet for visualizing graph algorithms.

Graph Theory
Implementation of a bunch of graph algorithms to analyze data of Facebook Friends.

graphsearch
Java graphics, to visualize search algorithms.

graphxt
A Graph visualization software focused on graph creation and animated algorithm execution. It has a plugin system which facilitates the introduction of new algorithms in the software.

jts algorithm pack
Java library that extends JTS with additional geometric and graph algorithms.

junto
This toolkit consists of implementations of various graph based semi supervised learning (SSL) algorithms. Currently, three algorithms are implemented: Gaussian Random Fields (GRF), Adsorption, and Modified Adsorption (MAD). Junto also contains Hadoop based implementations of these three algorithms.

textrank
Java implementation of the TextRank algorithm by Mihalcea, et al. http://lit.csci.unt.edu/index.php/ Graph based_NLP.

trickl graph
Contains graph algorithms, including many planar algorithms and a doubly connected edge list implementation.

Weighted Graph Max SavedPath
This Hadoop MapReduce program operates on a directed graph , in adjacency list format. The program computes the maximum total of node weights, from top to bottom of the directed graph , and records the path taken to get to the maximum total node weight, by performing a breadth first graph search using an iterative map reduce algorithm.