FORCE DIRECTED NETWORK (SPRING ALGORITHM) GRAPH VIEWER

From Protein Prediction 2 Winter Semester 2014
Revision as of 12:59, 11 December 2014 by Ppwikiuser (talk | contribs) (Worker)

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.

Introduction

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

Mockups

mockup 1
mockup 2
mockup 1
mockup 4


Functionality

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

Features

  • Import from Text format
  • Export to image
  • Visualization Using FORCE DIRECTED NETWORK

Application Design

  • Fancy Libraries
    • d3.js
    • jQuery
    • JavaScript InfoVis Toolkit

https://www.youtube.com/watch?v=3qo6EqwWmS0

Data

The input data should be in json/csv format

E.g: var json = [{

     "adjacencies": [  
         "graphnode21",   
         {  
           "nodeTo": "graphnode1",  
           "nodeFrom": "graphnode0",  
           "data": {  
             "$color": "#557EAA"  
           }  
         }, {  
           "nodeTo": "graphnode13",  
           "nodeFrom": "graphnode0",  
           "data": {  
             "$color": "#909291"  
           }  
         }, {  
           "nodeTo": "graphnode14",  
           "nodeFrom": "graphnode0",  
           "data": {  
             "$color": "#557EAA"  
           }  
         }]


data

RoadMap

mockup 1

Source Code

People

  • PP2_CS_2014 mentors, Björn Grüning (Galaxy) gruening. (at) .informatik.uni-freiburg.de
  • Students: Kommanapalli Vasantha Kumari,Anuradha Ganapati,Ahsan ZiaUllah

Additional Links