dda

Documentation

Overview

Package dda provides the implementation of Degree Decomposition Algorithm for finding maximal degree-based quasi-clique (QC)

Index

• func DDA(opts Opts) ([]graph.Nodes, int64, error)
• type GammaQCkSolver
• type GraphBuilder
• type Opts
• type SolveMode

Functions

func DDA

func DDA(opts Opts) ([]graph.Nodes, int64, error)

Implementation of DDA Returns three values: the array of maximal QC, the size of the max QC and the error

Types

type GammaQCkSolver

type GammaQCkSolver func(
	in graph.Undirected,
	gamma float64,
	k int64,
	allSolutions bool,
) (qcNodes []graph.Nodes, qcSize int64, err error)

GammaQCkSolver describes the function for solving gamma-QC(k) mixed-integer problem

type GraphBuilder

type GraphBuilder interface {
	graph.NodeAdder
	graph.EdgeAdder
	graph.Graph
}

type Opts

type Opts struct {
	InputGraph graph.Undirected
	Gamma      float64
	SolveMode  SolveMode
	YQCKSolver GammaQCkSolver
}

type SolveMode

type SolveMode bool

SolveMode describes how many solutions will be found by DDA

const (
	OneSolution  SolveMode = false
	AllSolutions SolveMode = true
)