Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

bipartitegraph

package

v1.1.0 Latest Latest Go to latest Published: Mar 26, 2017 License: MIT Imports: 5 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/ansd/gomega

Links

Open Source Insights

Documentation ¶

Index ¶

type BipartiteGraph
- func NewBipartiteGraph(leftValues, rightValues []interface{}, ...) (*BipartiteGraph, error)
- func (bg *BipartiteGraph) LargestMatching() (matching EdgeSet)

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type BipartiteGraph ¶

type BipartiteGraph struct {
	Left  NodeOrderedSet
	Right NodeOrderedSet
	Edges EdgeSet
}

func NewBipartiteGraph ¶

func NewBipartiteGraph(leftValues, rightValues []interface{}, neighbours func(interface{}, interface{}) (bool, error)) (*BipartiteGraph, error)

func (*BipartiteGraph) LargestMatching ¶

func (bg *BipartiteGraph) LargestMatching() (matching EdgeSet)

Source Files ¶

View all Source files