Categorygithub.com/gonum/graph
modulepackage
0.0.0-20190426092945-678096d81a4b
Repository: https://github.com/gonum/graph.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
1
Dependents
1.6k
Files
252 SLOC

# README

Gonum Graph Build Status Coverage Status GoDoc

This repository is no longer maintained. Development has moved to https://github.com/gonum/gonum.

This is a generalized graph package for the Go language. It aims to provide a clean, transparent API for common algorithms on arbitrary graphs such as finding the graph's strongly connected components, dominators, or searces.

The package is currently in testing, and the API is "semi-stable". The signatures of any functions like AStar are unlikely to change much, but the Graph, Node, and Edge interfaces may change a bit.

Issues

If you find any bugs, feel free to file an issue on the github issue tracker for gonum/gonum if the bug exists in that reposity; no code changes will be made to this repository. Other dicussions should be taken to the gonum-dev Google Group.

https://groups.google.com/forum/#!forum/gonum-dev

License

Please see github.com/gonum/license for general license information, contributors, authors, etc on the Gonum suite of packages.

# Packages

This repository is no longer maintained.
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
This repository is no longer maintained.
This repository is no longer maintained.
This repository is no longer maintained.
This repository is no longer maintained.
This repository is no longer maintained.

# Functions

Copy copies nodes and edges as undirected edges from the source to the destination without first clearing the destination.

# Structs

EdgePair is an opposed pair of directed edges.
Undirect converts a directed graph to an undirected graph, resolving edge weight conflicts.

# Interfaces

Builder is a graph that can have nodes and edges added.
Directed is a directed graph.
DirectedBuilder is a directed graph builder.
Edge is a graph edge.
EdgeRemover is an interface for removing nodes from a graph.
EdgeSetter is an interface for adding edges to a graph.
Graph is a generalized graph.
Node is a graph node.
NodeAdder is an interface for adding arbitrary nodes to a graph.
NodeRemover is an interface for removing nodes from a graph.
Undirected is an undirected graph.
UndirectedBuilder is an undirected graph builder.
Weighter defines graphs that can report edge weights.