代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/458518/7295070
txt readme-visual-c++.txt
Protothreads can in some cases fail to compile under Visual C++
version 6.0 due to a bug in the compiler. See the following page for a
solution to the problem:
http://support.microsoft.com/default.as
www.eeworm.com/read/456869/7337948
readme
Python-to-libsvm interface
Table of Contents
=================
- Introduction
- Installation
- Usage
- Examples
Introduction
============
Python (http://www.python.org/) is a programming language
www.eeworm.com/read/448636/7528848
m grminabsverset.m
function nMS=grMinAbsVerSet(E,d)
% Function nMS=grMinAbsVerSet(E,d) solve the minimal absorbant set problem
% for the graph vertexes.
% Input parameters:
% E(m,2) - the edges of graph;
%
www.eeworm.com/read/448636/7528850
m grminedgecover.m
function nMC=grMinEdgeCover(E)
% Function nMC=grMinEdgeCover(E) solve the minimal edge cover problem.
% Input parameter:
% E(m,2) or (m,3) - the edges of graph and their weight;
% 1st and 2
www.eeworm.com/read/448636/7528853
m grminabsedgeset.m
function nMS=grMinAbsEdgeSet(E)
% Function nMS=grMinAbsEdgeSet(E) solve the minimal absorbant set problem
% for the graph edges.
% Input parameter:
% E(m,2) or (m,3) - the edges of graph and
www.eeworm.com/read/448636/7528854
m grmaxmatch.m
function nMM=grMaxMatch(E)
% Function nMM=grMaxMath(E) solve the maximal matching problem.
% Input parameter:
% E(m,2) or (m,3) - the edges of graph and their weight;
% 1st and 2nd elements
www.eeworm.com/read/448636/7528857
m grmaxstabset.m
function nMS=grMaxStabSet(E,d)
% Function nMS=grMaxStabSet(E,d) solve the maximal stable set problem.
% Input parameters:
% E(m,2) - the edges of graph;
% 1st and 2nd elements of each row i
www.eeworm.com/read/448636/7528858
m grminvercover.m
function nMC=grMinVerCover(E,d)
% Function nMC=grMinVerCover(E,d) solve the minimal vertex cover problem.
% Input parameters:
% E(m,2) - the edges of graph;
% 1st and 2nd elements of each r
www.eeworm.com/read/448636/7528859
m grtravsale.m
function [pTS,fmin]=grTravSale(C)
% Function [pTS,fmin]=grTravSale(C) solve the nonsymmetrical
% traveling salesman problem.
% Input parameter:
% C(n,n) - matrix of distances between cities,
www.eeworm.com/read/448628/7528918
m contents.m
% GrTheory - Graph Theory Toolbox.
%
% Functions:
% grBase - find all bases of digraph;
% grCoBase - find all contrabases of digraph;
% grCoCycleBasis - find all independent cut-sets for a conne