adjLists

Documentation

Index

• Variables
• type AdjLists
  • func NewAL() AdjLists
  • func (a *AdjLists) AddEdge(n1, n2 *vertexes.Vertexes)
  • func (a *AdjLists) AddNode(node *vertexes.Vertexes)
  • func (a *AdjLists) Connected() bool
  • func (a *AdjLists) Copy() AdjLists
  • func (a *AdjLists) EdgeCount() int
  • func (a *AdjLists) FirstNode() *vertexes.Vertexes
  • func (a *AdjLists) Genus() int
  • func (a *AdjLists) HamiltonianPaths(minLength int, stopOnFirstPath bool, includeReverse bool) [][]*vertexes.Vertexes
  • func (a *AdjLists) HasNode(node vertexes.Vertexes) bool
  • func (a *AdjLists) MinimalVertexCover() map[uint64]*vertexes.Vertexes
  • func (a *AdjLists) NodeCount() int
  • func (a *AdjLists) NodeWithMostEdges() *vertexes.Vertexes
  • func (a *AdjLists) Nodes() map[uint64]*vertexes.Vertexes
  • func (a *AdjLists) RemoveNode(node vertexes.Vertexes)
  • func (a *AdjLists) RemoveOrphans()
  • func (a *AdjLists) Serialize(title string) string
  • func (a *AdjLists) ValueLowest() *vertexes.Vertexes
  • func (a *AdjLists) ValueSum() int
  • func (a *AdjLists) Whiskers() map[uint64]*vertexes.Vertexes

Variables

var (
	RunningID int64
)

Types

type AdjLists

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

AdjLists implements an undirected graph

func NewAL

func NewAL() AdjLists

NewAL returns a new, empty adjacency list

func (*AdjLists) AddEdge

func (a *AdjLists) AddEdge(n1, n2 *vertexes.Vertexes)

AddEdge adds an edge, adding the nodes if they are not already present

func (*AdjLists) AddNode

func (a *AdjLists) AddNode(node *vertexes.Vertexes)

AddNode adds a node to the adjacency list if not already present

func (*AdjLists) Connected

func (a *AdjLists) Connected() bool

Connected returns true if every vertex is reachable from every other vertex

func (*AdjLists) Copy

func (a *AdjLists) Copy() AdjLists

Copy returns a copy of the AdjacencyList

func (*AdjLists) EdgeCount

func (a *AdjLists) EdgeCount() int

EdgeCount returns the number of distinct edges in the adjacency list

func (*AdjLists) FirstNode

func (a *AdjLists) FirstNode() *vertexes.Vertexes

FirstNode returns a node from the map

func (*AdjLists) Genus

func (a *AdjLists) Genus() int

Genus returns the genus number of the adjacency list

func (*AdjLists) HamiltonianPaths

func (a *AdjLists) HamiltonianPaths(minLength int, stopOnFirstPath bool, includeReverse bool) [][]*vertexes.Vertexes

HamiltonianPaths returns paths, the traversal of which touch each vertex once

func (*AdjLists) HasNode

func (a *AdjLists) HasNode(node vertexes.Vertexes) bool

HasNode returns true if the node is already in the adjacency list

func (*AdjLists) MinimalVertexCover

func (a *AdjLists) MinimalVertexCover() map[uint64]*vertexes.Vertexes

MinimalVertexCover returns vertices that make a minimal (not guaranteed to be minimum) vertex cover

func (*AdjLists) NodeCount

func (a *AdjLists) NodeCount() int

NodeCount returns the number of nodes in the adjacency list

func (*AdjLists) NodeWithMostEdges

func (a *AdjLists) NodeWithMostEdges() *vertexes.Vertexes

NodeWithMostEdges returns the node with the highest edge count

func (*AdjLists) Nodes

func (a *AdjLists) Nodes() map[uint64]*vertexes.Vertexes

Nodes returns the map of nodes in the adjacency list

func (*AdjLists) RemoveNode

func (a *AdjLists) RemoveNode(node vertexes.Vertexes)

RemoveNode removes a node from the adjacency list

func (*AdjLists) RemoveOrphans

func (a *AdjLists) RemoveOrphans()

RemoveOrphans removes all vertices that have no edges

func (*AdjLists) Serialize

func (a *AdjLists) Serialize(title string) string

Serialize returns the adjacency list in graphviz format

func (*AdjLists) ValueLowest

func (a *AdjLists) ValueLowest() *vertexes.Vertexes

ValueLowest returns the node with the lowest value

func (*AdjLists) ValueSum

func (a *AdjLists) ValueSum() int

ValueSum returns the sum of all node values

func (*AdjLists) Whiskers

func (a *AdjLists) Whiskers() map[uint64]*vertexes.Vertexes

Whiskers returns a map of vertices that have only one edge