algorithm

package

v0.0.0-...-c564278 Latest Latest Go to latest Published: May 30, 2020 License: MIT Imports: 9 Imported by: 1

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type Algorithm interface {
	Select(activated set.Set) set.Set
}

type CELF struct {
	// contains filtered or unexported fields
}

func NewCELF(graph *util.Graph, config *util.Config, t int) *CELF

func (c *CELF) Select(activated set.Set) set.Set

type DiscountDegree struct {
	// contains filtered or unexported fields
}

func NewDiscountDegree(graph *util.Graph, config *util.Config, t int) *DiscountDegree

func (dd *DiscountDegree) Select(activated set.Set) set.Set

type MaxDegree struct {
	// contains filtered or unexported fields
}

func NewMaxDegree(graph *util.Graph, config *util.Config, t int) *MaxDegree

func (md *MaxDegree) Select(activated set.Set) set.Set

type Node struct {
	// contains filtered or unexported fields
}

type PMC struct {
	// contains filtered or unexported fields
}

N. Ohsaka et al., Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations, AAAI 2014. https://github.com/todo314/pruned-monte-carlo

func NewPMC(graph *util.Graph, config *util.Config, t int) *PMC

func (c *PMC) Select(activated set.Set) set.Set

type TIM struct {
	// contains filtered or unexported fields
}

func NewTIM(graph *util.Graph, config *util.Config, t int) *TIM

func (c *TIM) Select(activated set.Set) set.Set