The Java Universal NetworkGraph java通用网络图研究 .pptVIP

The Java Universal Network/Graph Framework (JUNG):A Brief Tour Danyel Fisher PhD CandidateDepartment of Informatics School of Information and Computer Science with Joshua O’Madadhain and Scott White Network Stories SUNBELT 2000 270 People Structural Holes Database to UCINET to Pajek to MAGE “I still use UCINET IV from 1992” SOCNET LIST “I need a new algorithm” “How does this algorithm do it?” Reworking it all for a Java applet Programmatic Solution Programmable Make it easy to do the same thing again Library Can be a server, a client, or a small part of a larger application Extensible If you need a new routine, you can put it in yourself Open Source Take it apart and put it together some other way JUNG General framework for graph modeling, analysis, and visualization object-oriented framework for many graphs easy visualization rich attribute structure complex filtering dynamic graphs Target audience is Java programmers with interest (but not expertise) in graphs Overview Creating a graph Annotating with data Filters Graph drawing Algorithms Demonstration Creating a graph Load from a file Pajek GraphML (XML) Build from scratch Create vertices individuallygraph.add( new SparseVertex() ); Specify edgesgraph.add( new DirectedEdge( v1, v2) ); (Combine to create SQL or other format reader) Use a graph generator Small-world graphs Power-law graphs Adding user-defined data key-value pairs associated withgraphs, edges, vertices easy to write algorithms that operate on relational data String name = vertex.getUserDatum(NAME); edge.setUserDatum(DATE, new Date()); Decorator infrastructure allows graph to be tagged with standard weights labels indices 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 All nodes with “weight” 0.2 and location is “California” with degree 1 Automate complex graph transformations acc