graph package by golang

Overview

graph-go

Go Reference test License

sample

package main

import (
	"fmt"
	"github.com/Iovesophy/graph-go"
)

func main() {
	samplePlace := []graph.Node{
		{ID: 1, Element: "place-A"},
		{ID: 2, Element: "place-B"},
		{ID: 3, Element: "place-C"},
		{ID: 4, Element: "place-D"},
	}
	sampleStation := []graph.Node{
		{ID: 5, Element: "station-A"},
		{ID: 6, Element: "station-B"},
	}
	g := &graph.NewGraph{
		NodeA: samplePlace,
		NodeB: sampleStation,
	}

	val1 , _ := g.CreateUndirectedVertexesPair()
	val2 , _ := g.CreateUndirectedEdge()
	fmt.Println(val1,val2)
	graph.ShowUndirectedGraph(g)
}

https://play.golang.org/p/XDfxWXtNN_m

License

Copyright (c) 2021 Kazuya yuda. This software is released under the MIT License, see LICENSE. https://opensource.org/licenses/mit-license.php

Releases(v1.0.2)
  • v1.0.2(Oct 14, 2021)

    What's Changed

    • Add Codecov by @Iovesophy in https://github.com/Iovesophy/graph-go/pull/3
    • hot-fix-document by @Iovesophy in https://github.com/Iovesophy/graph-go/pull/5
    • Add directedgraph by @Iovesophy in https://github.com/Iovesophy/graph-go/pull/2

    Full Changelog: https://github.com/Iovesophy/graph-go/compare/v1.0.1...v1.0.2

    Source code(tar.gz)
    Source code(zip)
Owner
Iovesophy
I hope this account make up Input Output Vector for sophy.
Iovesophy
Graph algorithms written in Go

Graph Algorithms in Go This repository contains implementations of various graph algorithms written in Go. I’ve written them to learn about these algo

Thomas Cyron 47 Jun 21, 2022
Some algorithms in go: maxflow(min-cuts or graph-cuts), edit-distance.

Algorithms In this repository, some algorithms are implemented in go language. GoDoc link: ed maxflow About Max-flow problem: A flow network is repres

Yi Deng 14 Apr 9, 2021
Go framework to simplify CRUD of structured data using Graph operations

gocrud Go framework to simplify creating, reading, updating, and deleting arbitrary depth structured data — to make building REST services fast and ea

Manish R Jain 315 Feb 8, 2022
Graph algorithms and data structures

Your basic graph Golang library of basic graph algorithms Topological ordering, image by David Eppstein, CC0 1.0. This library offers efficient and we

Algorithms to Go 9 Jan 25, 2021
dagger is a fast, concurrency safe, mutable, in-memory directed graph library with zero dependencies

dagger is a blazing fast, concurrency safe, mutable, in-memory directed graph implementation with zero dependencies

Coleman Word 258 Jun 23, 2022
A Connected Graph Generator tool that construct graphs of some given size

graph graph is a Connected Graph Generator tool that construct graphs of some given size. Notice that it generates all possible connected, undirected

Nicolas A Perez 0 Nov 5, 2021
Graphoscope: a solution to access multiple independent data sources from a common UI and show data relations as a graph

Graphoscope A solution to access multiple independent data sources from a common UI and show data relations as a graph: Contains a list of by default

CERT.LV 29 May 26, 2022
Package set is a small wrapper around the official reflect package that facilitates loose type conversion and assignment into native Go types.

Package set is a small wrapper around the official reflect package that facilitates loose type conversion and assignment into native Go types. Read th

null 37 Jun 15, 2022
Go package implementing bitsets

bitset Go language library to map between non-negative integers and boolean values Description Package bitset implements bitsets, a mapping between no

Will Fitzgerald 889 Jun 22, 2022
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.

Hilbert Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. Documentation available here This is not an

Google 252 Jun 20, 2022
Package ring provides a high performance and thread safe Go implementation of a bloom filter.

ring - high performance bloom filter Package ring provides a high performance and thread safe Go implementation of a bloom filter. Usage Please see th

Tanner Ryan 126 May 10, 2022
Go package implementing Bloom filters

Bloom filters A Bloom filter is a representation of a set of n items, where the main requirement is to make membership queries; i.e., whether an item

Will Fitzgerald 1.6k Jun 26, 2022
Go package implementing an indexable ordered multimap

PACKAGE package skiplist import "github.com/glenn-brown/skiplist" Package skiplist implements fast indexable ordered multimaps. This sk

Glenn Brown 24 May 14, 2021
A package for Go that can be used for range queries on large number of intervals

go-stree go-stree is a package for Go that can be used to process a large number of intervals. The main purpose of this module is to solve the followi

Thomas Oberndörfer 39 May 14, 2022
parody of some of the basic python core features (collections package)

collections import "github.com/marcsantiago/collections" Overview Index Subdirectories Overview Index func StringEncoder(encoder *bytes.Buffer, data D

Marc Santiago 18 Jan 14, 2022
Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of strings.

MA-FSA for Go Package mafsa implements Minimal Acyclic Finite State Automata (MA-FSA) with Minimal Perfect Hashing (MPH). Basically, it's a set of str

SmartyStreets (Archives) 290 Jun 22, 2022
Package for indexing zip files and storing a compressed index

zipindex zipindex provides a size optimized representation of a zip file to allow decompressing the file without reading the zip file index. It will o

High Performance, Kubernetes Native Object Storage 27 May 10, 2022
peanut is a Go package to write tagged data structs to disk in a variety of formats.

peanut peanut is a Go package to write tagged data structs to disk in a variety of formats. Its primary purpose is to provide a single consistent inte

Jim Smart 3 Apr 21, 2021
Go package implementing Bloom filters

Bloom filters A Bloom filter is a concise/compressed representation of a set, where the main requirement is to make membership queries; i.e., whether

Go language BitSet and Bloom filter 1.6k Jun 20, 2022