Migrate to modules, refactor Makefile and use Travis for CI

- migrate to Go modules and remove vendor
- refactor Makefile
- add version package and store version
- split extras from the rest
- use travis for CI

Change-Id: I81b35220653b0f7c9a0fcdd4c527d691ec1e96c1
Signed-off-by: Ondrej Fabry <ofabry@cisco.com>

1 files changed, 0 insertions, 41 deletions

diff --git a/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraph.go b/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraph.go
deleted file mode 100644
index 119d21e..0000000
--- a/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraph.go
+++ /dev/null
@@ -1,41 +0,0 @@
-package bipartitegraph
-
-import "errors"
-import "fmt"
-
-import . "github.com/onsi/gomega/matchers/support/goraph/node"
-import . "github.com/onsi/gomega/matchers/support/goraph/edge"
-
-type BipartiteGraph struct {
-	Left  NodeOrderedSet
-	Right NodeOrderedSet
-	Edges EdgeSet
-}
-
-func NewBipartiteGraph(leftValues, rightValues []interface{}, neighbours func(interface{}, interface{}) (bool, error)) (*BipartiteGraph, error) {
-	left := NodeOrderedSet{}
-	for i, _ := range leftValues {
-		left = append(left, Node{i})
-	}
-
-	right := NodeOrderedSet{}
-	for j, _ := range rightValues {
-		right = append(right, Node{j + len(left)})
-	}
-
-	edges := EdgeSet{}
-	for i, leftValue := range leftValues {
-		for j, rightValue := range rightValues {
-			neighbours, err := neighbours(leftValue, rightValue)
-			if err != nil {
-				return nil, errors.New(fmt.Sprintf("error determining adjacency for %v and %v: %s", leftValue, rightValue, err.Error()))
-			}
-
-			if neighbours {
-				edges = append(edges, Edge{left[i], right[j]})
-			}
-		}
-	}
-
-	return &BipartiteGraph{left, right, edges}, nil
-}