代码搜索：linked
找到约 4,326 项符合「linked」的源代码
代码结果 4,326
www.eeworm.com/read/443457/7632597
cpp 2066.cpp
#include
#include
const int maxint=0x7fffffff;
int length[1010][1010];
int Dijkstra(int a, int b, int n)
{
int i, j, u;
int dist[1010];
bool s[1010];
for(i
www.eeworm.com/read/436521/7768690
h node.h
/*
** Sample declaration for a linked list node. Change this declaration
** as appropriate for your list values and recompile the linked list
** search function with it. Note that the value can b
www.eeworm.com/read/298929/7923188
txt readme.txt
These routines may have some of the following dependencies:
0) The routines are in a package "ZS". This is of course optional,
you can simply comment out the ZS and use the routine inside
the defaul
www.eeworm.com/read/298606/7949751
h moves.h
/****************************************************
Author: S. Senthil kumar
Class Name: Moves
Purpose: To Generate Moves and store in a linked list
****************************************
www.eeworm.com/read/398241/7998037
java edgelink.java
package reg402;
import java.awt.Rectangle;
public class EdgeLink {
GraphNode n1; //边的一个结点
GraphNode n2; //边的另一个结点
String label; //边的权值
EdgeLink linked; //指向另一条边
www.eeworm.com/read/396406/8109189
c usblistlib.c
/* usbListLib.c - Linked list utility functions */
/* Copyright 2000 Wind River Systems, Inc. */
/*
Modification history
--------------------
01a,10jun99,rcb First.
*/
/*
DESCRIPTION
This file in
www.eeworm.com/read/332926/12716996
c 2.14.c
2.14② 试写一算法在带头结点的单链表结构上实现线性表
操作Length(L)。
实现下列函数：
int Length(LinkList L);
// Return the length of the linked list
// whose head node is pointed by 'L'
单链表类型定义如下：
typedef struct LNode{
www.eeworm.com/read/327628/13070238
java edgelink.java
package reg2nfa;
import java.awt.Rectangle;
public class EdgeLink {
GraphNode n1; //边的一个结点
GraphNode n2; //边的另一个结点
String label; //边的权值
EdgeLink linked; //指向另一条边
www.eeworm.com/read/325486/13201081
java test.java
/** Test code from part 2. */
public class Test {
public static void main(String[] args) {
// Array stack
{
System.out.println("Array stack:");
Stack s = new ArrayStack
www.eeworm.com/read/138638/13227514
h node.h
/*
** Sample declaration for a linked list node. Change this declaration
** as appropriate for your list values and recompile the linked list
** search function with it. Note that the value can b