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
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.