Ohloh by Black Duck

 Follow @ Meta   Join Now

 Settings |  Report Duplicate
Inactive
0

Project Summary

  Analyzed about 18 hours ago based on code collected about 18 hours ago.

Graphs consist of nodes joined by edges. Nodes have data, and edges have weights. There are a many operations that make a graph, their performance varies with implementation. Many problems can be expressed in terms of graphs, among them is cluster analysis. In cluster analysis items are grouped by similarity. The FastGraph implementation presented here works well for cluster analysis.

Graph implementations compared:
- Matrix (2D array)
- Adjacency Map
- FastGraph

Share

Quick Reference

Project Links:

Code Locations:
http://fastgraph.googlecode.com/...
Licenses:
BSD-4-Clause-UC
Similar Projects:
Managers:
Become the first manager for fastgraph
Browse Code

In a Nutshell, fastgraph...

Languages

Java 		100%
 
 

Lines of Code

 

Activity

30 Day Summary Apr 18 2013 — May 18 2013

12 Month Summary May 18 2012 — May 18 2013

Commits per Month

Community

Ratings

Be the first to rate this project
 
Click to add your rating
 
Review this Project!

Most Recent Contributors

Anon32 ostrovsky.alex    

Contributors per Month

 
 
 

Project Summary

Code Data

SCM Data

Community Data

 

Creative Commons License Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.