This small project is used to prune a general graph (not necessary connected) into a graph (induced subgraph) with all vertices' degree greater than predefined cutoff value k. It is mainly a implementation of priority queue.
Commercial Use
Modify
Distribute
Sub-License
Hold Liable
Use Trademarks
Distribute Original
Disclose Source
Include Copyright
These details are provided for information only. No information here is legal advice and should not be used as such.