代码搜索：Vertex2
找到约 23 项符合「Vertex2」的源代码
代码结果 23
www.eeworm.com/read/250360/12411502
cpp graph.cpp
#include
using namespace std;
#define max1 50
#define max2 50
struct vertex1
{ int ver[max1];
int e[max1][max1];
int m,n;
};
//定义队列
struct QUEUE{ int que[max1];
www.eeworm.com/read/272848/10940712
h edge.h
// abstract class for graph edges
#ifndef edge_
#define edge_
using namespace std;
template
class edge
{
public:
virtual ~edge() {};
virtual int vertex1() const
www.eeworm.com/read/433389/7933362
cpp explosion.cpp
#include "StdAfx.h"
#include "../common/myd3d.h"
#include "explosion.h"
using namespace d3d;
extern IDirect3DDevice9* g_device;
extern HWND g_hwnd;
Explosion::Explosion()
{
}
Explosion
www.eeworm.com/read/146126/12668513
h edge.h
// abstract class for graph edges
#ifndef edge_
#define edge_
using namespace std;
template
class edge
{
public:
virtual ~edge() {};
virtual int vertex1() const
www.eeworm.com/read/410595/11275859
h zeroknow.h
#ifndef ZEROKNOW_H
#define ZEROKNOW_H
#include "cryptlib.h"
#include "misc.h"
#include "bitarray.h"
#include
#include
class ostream;
class SimpleGraph
{
public:
www.eeworm.com/read/260514/11722496
h zeroknow.h
#ifndef ZEROKNOW_H
#define ZEROKNOW_H
#include "cryptlib.h"
#include "misc.h"
#include "bitarray.h"
#include
#include
class ostream;
class SimpleGraph
{
public:
www.eeworm.com/read/259580/11780331
h edge.h
// abstract class for graph edges
#ifndef edge_
#define edge_
using namespace std;
template
class edge
{
public:
virtual ~edge() {};
virtual int vertex1() const
www.eeworm.com/read/162614/5528156
c 930523-1.c
int v;
f ()
{
unsigned long *a1, *a2;
int vertex2;
int c, x1, x2, dx1, dx2, dy1, dy2, e1, e2, s2;
unsigned long m, b;
int n;
unsigned long r;
int aba;
do
{
if (dx2 >= dy2)
www.eeworm.com/read/224464/14589558
txt prim.txt
＃include
#define Max 10
#define VertexNum 5
Struct List /*节点结构声明*/
{
Int marked; /*查找标记*/
Int vertex1; /*顶点声明*/
Int vertex2; /*顶点声明*/
Int weight;
www.eeworm.com/read/377974/9255197
cpp kruskal.cpp
#include
#include
#define Max 10
#define VertexNum 5
struct List
{
int Vertex1;
int Vertex2;
int Weight;
struct List *Next;
};
typedef struct List Node;
typedef No