From ca6003af1a7e1adb7d45879c2d5038bc05c2bb1a Mon Sep 17 00:00:00 2001
From: Ondrej Fabry <ofabry@cisco.com>
Date: Fri, 2 Aug 2019 15:07:53 +0200
Subject: 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>
---
 .../bipartitegraph/bipartitegraphmatching.go       | 161 ---------------------
 1 file changed, 161 deletions(-)
 delete mode 100644 vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraphmatching.go

(limited to 'vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraphmatching.go')

diff --git a/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraphmatching.go b/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraphmatching.go
deleted file mode 100644
index 32529c5..0000000
--- a/vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraphmatching.go
+++ /dev/null
@@ -1,161 +0,0 @@
-package bipartitegraph
-
-import . "github.com/onsi/gomega/matchers/support/goraph/node"
-import . "github.com/onsi/gomega/matchers/support/goraph/edge"
-import "github.com/onsi/gomega/matchers/support/goraph/util"
-
-func (bg *BipartiteGraph) LargestMatching() (matching EdgeSet) {
-	paths := bg.maximalDisjointSLAPCollection(matching)
-
-	for len(paths) > 0 {
-		for _, path := range paths {
-			matching = matching.SymmetricDifference(path)
-		}
-		paths = bg.maximalDisjointSLAPCollection(matching)
-	}
-
-	return
-}
-
-func (bg *BipartiteGraph) maximalDisjointSLAPCollection(matching EdgeSet) (result []EdgeSet) {
-	guideLayers := bg.createSLAPGuideLayers(matching)
-	if len(guideLayers) == 0 {
-		return
-	}
-
-	used := make(map[Node]bool)
-
-	for _, u := range guideLayers[len(guideLayers)-1] {
-		slap, found := bg.findDisjointSLAP(u, matching, guideLayers, used)
-		if found {
-			for _, edge := range slap {
-				used[edge.Node1] = true
-				used[edge.Node2] = true
-			}
-			result = append(result, slap)
-		}
-	}
-
-	return
-}
-
-func (bg *BipartiteGraph) findDisjointSLAP(
-	start Node,
-	matching EdgeSet,
-	guideLayers []NodeOrderedSet,
-	used map[Node]bool,
-) ([]Edge, bool) {
-	return bg.findDisjointSLAPHelper(start, EdgeSet{}, len(guideLayers)-1, matching, guideLayers, used)
-}
-
-func (bg *BipartiteGraph) findDisjointSLAPHelper(
-	currentNode Node,
-	currentSLAP EdgeSet,
-	currentLevel int,
-	matching EdgeSet,
-	guideLayers []NodeOrderedSet,
-	used map[Node]bool,
-) (EdgeSet, bool) {
-	used[currentNode] = true
-
-	if currentLevel == 0 {
-		return currentSLAP, true
-	}
-
-	for _, nextNode := range guideLayers[currentLevel-1] {
-		if used[nextNode] {
-			continue
-		}
-
-		edge, found := bg.Edges.FindByNodes(currentNode, nextNode)
-		if !found {
-			continue
-		}
-
-		if matching.Contains(edge) == util.Odd(currentLevel) {
-			continue
-		}
-
-		currentSLAP = append(currentSLAP, edge)
-		slap, found := bg.findDisjointSLAPHelper(nextNode, currentSLAP, currentLevel-1, matching, guideLayers, used)
-		if found {
-			return slap, true
-		}
-		currentSLAP = currentSLAP[:len(currentSLAP)-1]
-	}
-
-	used[currentNode] = false
-	return nil, false
-}
-
-func (bg *BipartiteGraph) createSLAPGuideLayers(matching EdgeSet) (guideLayers []NodeOrderedSet) {
-	used := make(map[Node]bool)
-	currentLayer := NodeOrderedSet{}
-
-	for _, node := range bg.Left {
-		if matching.Free(node) {
-			used[node] = true
-			currentLayer = append(currentLayer, node)
-		}
-	}
-
-	if len(currentLayer) == 0 {
-		return []NodeOrderedSet{}
-	} else {
-		guideLayers = append(guideLayers, currentLayer)
-	}
-
-	done := false
-
-	for !done {
-		lastLayer := currentLayer
-		currentLayer = NodeOrderedSet{}
-
-		if util.Odd(len(guideLayers)) {
-			for _, leftNode := range lastLayer {
-				for _, rightNode := range bg.Right {
-					if used[rightNode] {
-						continue
-					}
-
-					edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
-					if !found || matching.Contains(edge) {
-						continue
-					}
-
-					currentLayer = append(currentLayer, rightNode)
-					used[rightNode] = true
-
-					if matching.Free(rightNode) {
-						done = true
-					}
-				}
-			}
-		} else {
-			for _, rightNode := range lastLayer {
-				for _, leftNode := range bg.Left {
-					if used[leftNode] {
-						continue
-					}
-
-					edge, found := bg.Edges.FindByNodes(leftNode, rightNode)
-					if !found || !matching.Contains(edge) {
-						continue
-					}
-
-					currentLayer = append(currentLayer, leftNode)
-					used[leftNode] = true
-				}
-			}
-
-		}
-
-		if len(currentLayer) == 0 {
-			return []NodeOrderedSet{}
-		} else {
-			guideLayers = append(guideLayers, currentLayer)
-		}
-	}
-
-	return
-}
-- 
cgit 1.2.3-korg