代码搜索：Problem
找到约 10,000 项符合「Problem」的源代码
代码结果 10,000
www.eeworm.com/read/221024/14778930
html http:^^www.cs.hmc.edu^~hadas^courses^cs6^submitting.html
Date: Tue, 14 Jan 1997 20:40:24 GMT
Server: NCSA/1.5.1
Last-modified: Mon, 11 Sep 1995 22:35:17 GMT
Content-type: text/html
Content-length: 1836
How to Submit Your Homework
www.eeworm.com/read/221024/14779353
html http:^^cdps.umcs.maine.edu:80^cdps-projects.html
Date: Wed, 15 Jan 1997 01:20:59 GMT
Server: Apache/1.1.1
Content-type: text/html
Content-length: 1459
Last-modified: Fri, 05 Jul 1996 15:09:28 GMT
CDPS Group Projects
www.eeworm.com/read/220696/14791508
m grmaxflows.m
function [v,mf]=grMaxFlows(E,s,t)
% Function [v,mf]=grMaxFlows(E,s,t) solve the problem
% about the maximal flow in the network.
% Input parameters:
% E(m,2) or (m,3) - the arrows of digraph a
www.eeworm.com/read/220696/14791523
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/220696/14791538
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/220696/14791544
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
www.eeworm.com/read/220696/14791550
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/220696/14791553
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/220696/14791569
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/220696/14791581
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