model-repoatt's Introduction
Calculation Of Minimum Sized (k,m) Connected Dominating Set (CDS) //Purpose of software ============================ This software uses the algorithm of Wu & Li and the process of the Namsu Ahn & Sungsoo Park paper to construct a minimum sized (k,m) Connected Dominating Set. The k parameter means that every dominator has at least k dominator neighbors and the m parameter means that every dominatee has at least m dominator neighbors. After the network construction, it uses the Wu & Li algorithm to calculate a minimum sized CDS. Then, based on the Ahn & Park process, it tries to expand that CDS to construct a minimum (k,m) CDS, if possible for the given k and m parameters. If not possible, it notifies the user to enter different k and m values. The papers referenced above are: On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc Wireless Networks Jie Wu and Hailan Li An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks Namsu Ahn - Sungsoo Park //Files explainded ========================= Apart from the Css files, the functionality is divided in the Model_Js files and the View_Js. In the Model_Js we have the files that manage the background stuff, like the construction of the network and the algrorithms run on it. In the View_Js files we have the management of the page view (apart from the graph view which is tied to the network construction in Model_Js). There are also external libary files in the 'External' folders. The network visual graph was made with joint.js. kConnected.html : The application's main file which displays the app. Instructions for use are displayed in the main page. network_manager.js : handles the construction and updates of the network, both as a graph displayed inside a view and the network global variable which contains all the network info. Every interaction with the graph view is handled here and NOT in the viewManager.js, because it is tied to the update of the network information. wu_li_cds: uses the Wu&Li algorithm to costruct a minimum Connected Dominating Set on the network constructed by the network_manager.js. k_m_algorithm.js : runs an algorithm on the network based on the Namsu Ahn - Sungsoo Park paper, to extend it to a minimum (k,m) CDS. pathfinding.js : used for finding all the paths between two nodes on the dominator subgraph and then calculates a minimum vertex cut, which is required by the Ahn-Park algorithm. viewManager.js : it handles some button and page view functionality, along with painting the dominator nodes after the algorithms finish their execution.
model-repoatt's People
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. ๐๐๐
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google โค๏ธ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.