代码搜索：Graph
找到约 10,000 项符合「Graph」的源代码
代码结果 10,000
www.eeworm.com/read/481966/6633659
cpp 2369.cpp
/* This Code is Submitted by wywcgs for Problem 2369 on 2006-10-06 at 11:07:20 */
#include
#include
#include
using namespace std;
const int N = 256;
class Rec
www.eeworm.com/read/481966/6634100
cpp 1789.cpp
/* This Code is Submitted by wywcgs for Problem 1789 on 2006-09-14 at 20:37:56 */
#include
#include
#include
using namespace std;
const int N = 10240;
class G
www.eeworm.com/read/480065/6676130
cpp graphview.cpp
// GraphView.cpp : implementation of the CGraphView class
//
#include "stdafx.h"
#include "Graph.h"
#include "GraphDoc.h"
#include "GraphView.h"
#include "Smalltree.h"
#ifdef _DEBUG
#def
www.eeworm.com/read/478535/6709187
cpp bitpartite.cpp
#include
#include
#include
#include
using namespace std;
const int N = 40960;
const int INF = 1
www.eeworm.com/read/478535/6709189
cpp ggmcm.cpp
#include
#include
#include
using namespace std;
const int N = 64;
class Graph {
private:
int n, mate[N];
bool g[N][N], inQ[N], inBlo[N];
queue Q;
in
www.eeworm.com/read/478535/6709197
cpp maxmatch.cpp
#include
#include
using namespace std;
const int N = 128;
class Graph {
private:
bool map[N][N], check[N];
int n, match[N];
bool dfs(int);
public:
int maxMatch()
www.eeworm.com/read/477190/6739679
java exp2.java
import java.util.Scanner;
public class exp2 {
public static void main(String agrs[]) {
System.out
.print("Please inoput your first graphic type you want to create:");
Scanner in = new
www.eeworm.com/read/476392/6759290
m sim12xxb.m
function [ret,x0,str,ts,xts]=sim12x9a(t,x,u,flag);
%SIM12X9A is the M-file description of the SIMULINK system named SIM12X9A.
% The block-diagram can be displayed by typing: SIM12X9A.
%
% SY
www.eeworm.com/read/265192/11273474
doc a.doc
一.需求分析
1.运行环境
硬件：计算机486/64M以上
操作系统： WIN9x 以上/WIN2000/WIN XP/WIN ME
相关软件：vistualC++
2．程序所实现的功能：
（1）建立并显示图的邻接表。
（2）深度优先遍历，显示遍历结果。
（3）对该图进行拓扑排序，显示排序结果。
（4）给出某一确定顶点到所有其 ...
www.eeworm.com/read/409392/11329042
cpp tsp.cpp
#include
#include
#include
#include
#define PRE temp->pre->vertex*count
#define NEXT temp->next->vertex*count
#define VER temp->vertex*count
struc