Difference between revisions of "FORCE DIRECTED NETWORK (SPRING ALGORITHM) GRAPH VIEWER"
From Protein Prediction 2 Winter Semester 2014
Ppwikiuser (talk | contribs) |
Ppwikiuser (talk | contribs) |
||
| Line 3: | Line 3: | ||
'''Students''': Kommanapalli Vasantha Kumari,Anuradha Ganapati,Ahsan ZiaUllah |
'''Students''': Kommanapalli Vasantha Kumari,Anuradha Ganapati,Ahsan ZiaUllah |
||
==Introduction== |
==Introduction== |
||
| + | ==Aim & Objective== |
||
| + | 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. |
||
==Mockups== |
==Mockups== |
||
==Application Design== |
==Application Design== |
||
Revision as of 18:29, 19 November 2014
Mentors: PP2_CS_2014 mentors, Yana Bromberg (Rutgers University), Björn Grüning (Galaxy) gruening. (at) .informatik.uni-freiburg.de
Students: Kommanapalli Vasantha Kumari,Anuradha Ganapati,Ahsan ZiaUllah
Introduction
Aim & Objective
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.
