MinDominatingSet | Java implementation to solve the Minimum Dominating Set

by JavaZakariae Java Version: Current License: No License

X-Ray Key Features Code Snippets Community Discussions Vulnerabilities Install Support

kandi X-RAY | MinDominatingSet Summary

MinDominatingSet is a Java library. MinDominatingSet has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.

In graph theory, the dominating set is a well know Np-complete problem. To date, we don't have a polynomial time algorithm to solve this problem. In my Master thesis, I did a review of literature about the well know exact, greedy and metha-heuristique solutions. This repository contains my Java implementation to solve the Minimum Dominanting Set.

Support

Quality

Security

License

Reuse

Support

MinDominatingSet has a low active ecosystem.

It has 0 star(s) with 0 fork(s). There are no watchers for this library.

It had no major release in the last 6 months.

There are 0 open issues and 2 have been closed. On average issues are closed in 4 days. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of MinDominatingSet is current.

Quality

MinDominatingSet has 0 bugs and 0 code smells.

Security

MinDominatingSet has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

MinDominatingSet code analysis shows 0 unresolved vulnerabilities.

There are 0 security hotspots that need review.

License

MinDominatingSet does not have a standard license declared.

Check the repository for any license declaration and review the terms closely.

Without a license, all rights are reserved, and you cannot use the library in your applications.

Reuse

MinDominatingSet releases are not available. You will need to build from source code and install.

Build file is available. You can build the component from source.

Installation instructions are not available. Examples and code snippets are available.

It has 3898 lines of code, 275 functions and 44 files.

It has medium code complexity. Code complexity directly impacts maintainability of the code.

Top functions reviewed by kandi - BETA

kandi has reviewed MinDominatingSet and discovered the below as its top functions. This is intended to give you an instant insight into MinDominatingSet implemented functionality, and help decide if they suit your requirements.

Calculates Mds for a cubic graph
Performs an evolutionary operation on the population .
Use D .
Performs a simple algorithm .
Creates a graph from a graph .
Runs the genetic algorithm on a file on the graph .
Perform the algorithm on the reduction rule .
Updates the covered variables .
Adjusts the weights for a vertex .
Perform a random repair on the given child .

Get all kandi verified functions for this library.

MinDominatingSet Key Features

No Key Features are available at this moment for MinDominatingSet.

MinDominatingSet Examples and Code Snippets

No Code Snippets are available at this moment for MinDominatingSet.

Community Discussions

No Community Discussions are available at this moment for MinDominatingSet.Refer to stack overflow page for discussions.

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install MinDominatingSet

You can download it from GitHub.
You can use MinDominatingSet like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the MinDominatingSet component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer maven.apache.org. For Gradle installation, please refer gradle.org .

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: