FORCE DIRECTED NETWORK (SPRING ALGORITHM) GRAPH VIEWER

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

Force Directed Graphs which are drawn using force directed graph algorithms(Eg:SPRING ALGORITHM) is based on positioning of the nodes of the graph in 2 or 3 dimensional space so that all the edges are more or less of the same length with few crossing edges.This is done by assigning forces among the set of edges and the set of nodes based on their relative positions.These forces are used to simulate the motion of edges and nodes.

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