FORCE DIRECTED NETWORK (SPRING ALGORITHM) GRAPH VIEWER
The objective of this project is to visualize a network (large networks of >2000 nodes) in a way that the distance of a node from the rest of the network is determined by the number of nodes it is connected to => the more neighbors a node has the larger is its distance from the network. The component must allow zooming in/out, selection by the number of neighbors, coloring by various thresholds and other graph-related features.
- 1 Introduction
- 2 Mockups
- 3 Application Design
- 4 Data
- 5 RoadMap
- 5.1 Roadmap for Implementation
- 5.2 First Week(21.11.2014 - 27.11.2014)
- 5.3 Second Week(28.11.2014 - 4.12.2014)
- 5.4 Third Week(5.12.2014 - 12.12.2014)
- 5.5 Fourth Week(13.12.2014 - 18.12.2014)
- 5.6 Fifth Week(19.12.2014 - 29.12 .2014)
- 5.7 Sixth Week(30.12.2014 - 05.01 .2015)
- 5.8 08.01.2015 Final Presentation
- 5.9 15.01.2015 Submission Deadline
- 6 Source Code
- 7 People
- 8 Additional Links
Force Directed Network is obtained by using the Force-directed graph drawing algorithms(SPRING ALGORITHM). This algorithm is mainly based on the forces assigned among the set of nodes and edges of a graph.The forces can be either atractive which is used to attract pairs of endpoints of the graph's edges towards each other or repulsive which is used to seperate all pairs of nodes.In equilibrium states for this system of forces,the edges tend to have uniform length(using spring forces) and the nodes which are not connected by any edge tend to be drawn further apart(due to electrical repulsion).
- Zoom in and Zoom out of the graph.
- Distance of a node from the rest of the network is determined by the number of nodes it is connected to.
- Selection by the number of neighbors
- Coloring by various thresholds
- Dividing the whole network into module based on the modularity.
- Applying filters.
- Defining the layout of your choice.
- Exporting the visualisation as an image.
- Import from Text format
- Export to image
- Visualization Using FORCE DIRECTED NETWORK
- Fancy Libraries
The input data should be in tsv format
Roadmap for Implementation
Cytoscape Worker API :
First Week(21.11.2014 - 27.11.2014)
- Learned about the concept of force directed graph and the algorithms.
- Deciding on the libraries to be used for the implementation
- Understood how spring layout works.
- Tried working with tools like Gephi in which we can visualize the network data.
- Got acquainted with our mentors.
Second Week(28.11.2014 - 4.12.2014)
- Explored about cytoscape and went through the list of issues sent by Max.
- Understood the goals that Max wanted us to implement.
- Defined the Milestone Plan.
- Decide on the Approach to parallelize code.
- Started working on web workers.
- Got Clarified the doubts related to web workers from Max's implementation.
- Started exploring about benchmark.js and parallel.js
Third Week(5.12.2014 - 12.12.2014)
- Did parallelisation using circle layout with the web workers implementation
Github repository: https://github.com/Ahsanzia/FDG
- Started working on the web worker implementation for spread layout
Fourth Week(13.12.2014 - 18.12.2014)
Report, work on Spread Layout Algorithm. Some functions parallelized if possible.
- Worked on visualization of 3000 nodes and corresponding edges using different features:
- Different layouts
- Zooming enabled and disabled
- Calculating the time for rendering of the layout.
- Getting all the nodes that are connected to a particular node on selection of a particular node
The following visualizations use spread layout.
The following graph shows the relationship between the nodes and time taken to visualize it.
Fifth Week(19.12.2014 - 29.12 .2014)
- Implemented the web workers for the springy layout.
- Working on the benchmarking of the springy layout
Sixth Week(30.12.2014 - 05.01 .2015)
08.01.2015 Final Presentation
15.01.2015 Submission Deadline
- PP2_CS_2014 mentors, Björn Grüning (Galaxy) gruening. (at) .informatik.uni-freiburg.de
- Students: Kommanapalli Vasantha Kumari,Anuradha Ganapati,Ahsan ZiaUllah