JUNG-讲解PPT.ppt

The Java Universal Network/Graph Framework (JUNG):A Brief Guided Tour Presented by Scott White Joshua O’Madadhain What is JUNG? General framework for the modeling, analysis, and visualization of graphs extendible object-oriented framework for any kind of graph rich attribute structure complex filtering dynamic graphs Uses social networks web graph analysis graph theory data mining More about JUNG Open-source (BSD license) Written in Java Created by 3 UCI CS PhD students: Scott White Joshua O’Madadhain Danyel Fisher Overview Creating a graph Annotating with data Filters Graph drawing Algorithms Demo Creating a graph with JUNG Three ways to create a new graph: Load from a file - Pajek - GraphML (XML) Build from scratch - Create vertices individually - Specify edges Use a graph generator - Small-world graphs - Power-law graphs Adding user-defined data key-value pairs associated with graphs, edges, vertices easy to write algorithms that operate on relational data String name = vertex.getUserDatum(NAME); edge.setUserDatum(DATE, new Date()); A decorated graph example Example: Using graph filters Extract sub-graphs of vertices and edges All edges with user-data “weight” 0.2 All nodes whose “location” is “California” All nodes with degree 1 Chain filters together: Automate complex graph transformations Custom Filters Write these routines: acceptVertex( Vertex v ) acceptEdge( Edge e ) Visualizing graphs with JUNG Provides a few basic layout algorithms: Fruchterman-Rheingold Eades Self-Organizing Maps Plug and play architecture Drop in your favorite renderer, layout Provided rendering engine is Swing-based (but layouts are generic) Simple Graph Display to display an existing graph: gd = new GraphDraw(g); jpanel.add(gd); now, start customizing... gd.setGraphLayout( new FRLayout( graph ) ); gd.setVertexBGColor(Color.BLUE); Custom Layouts and Renderers Layout algorithms specify vertex positions advancePositions() Renderers draw vertices and edges. paintEdge(