Contents.m

% The implementation of the Hyperbolic Vivaldi algorithm. It is hard to 
% describe the data. Therefore, I try to solve the problem with structs. 

% The structs description:

% node.id
% node.position
% node.degree
% node.neighbors
% node.category

% The data procedure:

% Initialize the id.
% Initialize the position.

% ##  Initialize the neighbors. ##

% Vivaldi system.(With degree considered.)
% Draw the figure.

% Purpose:
% Find the proper coordinate of the nodes in the Hyperbolic Space 2D.

% TODO:
% Node category may be used later.

% 2011-5-26 21:13:08
% 'Kechao'<caikechao@gmail.com>