1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
8 Copyright © 2003 The Regents of the University of California. All Rights Reserved.
9 Permission to use, copy, modify, and distribute this software and its documentation
10 for educational, research and non-profit purposes, without fee, and without a written
11 agreement is hereby granted, provided that the above copyright notice, this paragraph
12 and the following two paragraphs appear in all copies. This software program and
13 documentation are copyrighted by The Regents of the University of California
14 ("The University of California").
16 THE SOFTWARE PROGRAM AND DOCUMENTATION ARE SUPPLIED "AS IS," WITHOUT ANY ACCOMPANYING
17 SERVICES FROM THE UNIVERSITY OF CALFORNIA. FURTHERMORE, THE UNIVERSITY OF CALIFORNIA
18 DOES NOT WARRANT THAT THE OPERATION OF THE PROGRAM WILL BE UNINTERRUPTED OR
19 ERROR-FREE. THE END-USER UNDERSTANDS THAT THE PROGRAM WAS DEVELOPED FOR RESEARCH
20 PURPOSES AND IS ADVISED NOT TO RELY EXCLUSIVELY ON THE PROGRAM FOR ANY REASON.
22 IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR DIRECT,
23 INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS,
24 ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE
25 UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
26 THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
27 BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
28 PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS" BASIS,
29 AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE,
30 SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
35 <p>Algorithms for graphs and networks.</p>
37 <p>These algorithms are divided into categories as follows:
39 <li/><b>blockmodel</b>: dividing graph elements (typically vertices) into
41 generally by topological properties (e.g. structural equivalence)
42 <li/><b>cluster</b>: identifying coherent (not necessarily disjoint) groups of elements
43 (e.g. weakly connected components, edge betweenness clustering)
44 <li/><b>filters</b>: removing parts of a graph according to specified criteria
45 <li/><b>flows</b>: calculating properties relating to network flows
46 (e.g. max flow/min cut)
47 <li/><b>generators</b>: creating graphs with certain properties
48 <li/><b>importance (<i>deprecated</i>)</b>: assigning values to vertices/edges
49 based on topological properties
50 <li/><b>layout</b>: arrangement of graph elements, generally for visualization
51 <li/><b>metrics</b>: calculating structural properties (triad census, structural
53 <li/><b>scoring</b>: assigning values (denoting significance, influence,
54 centrality, etc.) to vertices/edges based on topological properties,
55 e.g. PageRank, HITS, betweenness centrality (replaces "importance", above)
56 <li/><b>shortestpath</b>: calculation of shortest paths between vertices
57 <li/><b>util</b>: low-level utility classes used in a variety of algorithms