#CySpanningTree
CySpanningTree is a Cytoscape app for minimal/maximal spanning tree subnetwork discovery. The subnetwork is extracted as a seperate Cytoscape network. Currently this app. has Prim's and Kruskal's algorithms implemented using Cytoscape 3 API. This app. can also find an approximate solution to TravellingSalesMan problem using MST as a heuristic.
##Citation
Shaik F, Bezawada S and Goveas N. CySpanningTree: Minimal Spanning Tree computation in Cytoscape [version 1; referees: 1 approved] F1000Research 2015, 4:476 (doi: 10.12688/f1000research.6797.1)
### Installation
Install [Cytoscape 3.x](http://www.cytoscape.org/).
Download the jar file and install it manually through Apps → App Manager → Install Apps.
Click Apps -> CySpanningTree, to get the user interface loaded in the control panel of Cytoscape.
Please, feel free to tell us about any bug you find or an issue you face while using our app! Submit issues at https://github.com/smd-faizan/CySpanningTree/issues
### Release notes for CySpanningTree 1.1:
*- GUI :* Enhanced user interface
*- New feature :* An approximate solution to the travelling salesman problem by deriving a Hamiltonian cycle from the obtained spanning tree. Click "Create Hamiltonian cycle" button
after inputting a fully connected Cytoscape network as input.
*- New feature :* The resultant network has the same layout as that of the input network with nodes positioned at the same location and edges scaled down to make the resultant graph spanning tree or a Hamiltonian cycle.
*- New feature :* Spanning Tree subnetworks when created, the corresponding spanning edges are highlighted/selected in the input network
*- New feature :* If disconnected graphs are given as input, an error message pops up and program quits
###Release notes for CySpanningTree 1:
*Currently the app expects the input data set to be connected graphs.*
