代码搜索：bipartite
找到约 50 项符合「bipartite」的源代码
代码结果 50
www.eeworm.com/read/234171/14120109
cpp bipartite.cpp
//匈牙利算法实现
int Bipartite(bool vc [][MAX],int nv1,int nv2) {
//vc[][]为二分图，nv1,nv2分别为左边的点数
int i, j, x, n;
//n为最大匹配数
int q[MAX], prev[MAX], qs, qe;
//q是BFS用的队列，prev是用来记录交错
www.eeworm.com/read/453619/7416418
cpp bipartite_matching.cpp
#include
#include
using namespace std;
#define MAXN 100
#define init(a,b) memset(a,b,sizeof(a))
int n,m,a,b,path,matchL[MAXN],matchR[MAXN];
bool edge[MAXN][MAXN];
bool seen[MAXN
www.eeworm.com/read/204071/15344890
cpp random_bipartite.cpp
/*
Copyright (C) 2003, Guillaume-Latapy - LIAFA (University of Paris 7)
Disclaimer: this code is provided 'as-is', without any express or
implied warranty. In no event will the authors be h
www.eeworm.com/read/197407/7997295
out bipart.out
Enter the number of vertices in the graph
Enter the number of edges in the graph
Enter edge 1
Enter edge 2
Enter edge 3
Enter edge 4
Enter edge 5
Enter edge 6
The input graph is
Vertex 1 = 3
www.eeworm.com/read/197407/7997843
cpp bipart.cpp
// check if a graph is bipartite
#include
#include "lg4.h"
void main(void)
{
LinkedGraph G(0);
int L[100];
// try two graphs
for (int j = 1; j
www.eeworm.com/read/346528/11739427
m realign.m
% realign Realignment of the bipartite density matrix.
% realign(M) realigns the matrix M (that can be a density matrix)
% in a bipartite system where the two parties have equal dimensions.
%
www.eeworm.com/read/393906/8255619
pdf a fast algorithm for non-bipartite maximal matching.pdf
www.eeworm.com/read/419693/10844781
h binnode.h
// struct used by bipartite cover
#ifndef binNode_
#define binNode_
struct binNode
{
int left, right; // pointers to left and right nodes
};
#endif
www.eeworm.com/read/272848/10940931
h binnode.h
// struct used by bipartite cover
#ifndef binNode_
#define binNode_
struct binNode
{
int left, right; // pointers to left and right nodes
};
#endif
www.eeworm.com/read/146126/12668654
h binnode.h
// struct used by bipartite cover
#ifndef binNode_
#define binNode_
struct binNode
{
int left, right; // pointers to left and right nodes
};
#endif