代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/323543/13336921
txt 神经网络程序.txt
/* Travelling Salesman Problem */
/* using Hopfield neural net */
#include
#include
#include
#include
#define N 10
www.eeworm.com/read/136752/13363114
c ivorbisfile_example.c
/********************************************************************
* *
* THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE
www.eeworm.com/read/322851/13363955
c main.c
/* Copyright (C) 1996, 1997, 2000 N.M. Maclaren
Copyright (C) 1996, 1997, 2000 The University of Cambridge
This is a complete SNTP implementation, which was easier to write than to port
xntp to
www.eeworm.com/read/136707/13365001
cpp makedesc.cpp
#include
#include
#include
#include
#include
#include
#if (defined(__GNUC__) && (defined(__i386__) || defined(__i48
www.eeworm.com/read/322098/13389925
c gzip.c
/* gzip (GNU zip) -- compress files with zip algorithm and 'compress' interface
* Copyright (C) 1992-1993 Jean-loup Gailly
* The unzip code was written and put in the public domain by Mark Adler.
www.eeworm.com/read/321972/13391568
m compare.m
% Script file: compare.m
%
% Purpose:
% To compare binary and formatted I/O operations.
% This program generates an array of 10,000 random
% values and writes it to disk both as a b
www.eeworm.com/read/321972/13391646
m calc_power.m
% Script file: calc_power.m
%
% Purpose:
% To calculate the current, real, reactive, and apparent power,
% and the power factor supplied to a load.
%
% Record of revisions:
% Da
www.eeworm.com/read/321144/13411699
cpp tsp40.cpp
#include
#include
# include
# include
# include
# include
# define N 10
# define NN N*N
# define G(x) ((1.0+ tanh(x/u0))/2.0)
voi
www.eeworm.com/read/319701/13446270
m tree1.m
function [T,sum]=tree1(A)
%求连通图的最小生成树
%适用于无向图
%A=[0 8 11 1 5 2
% 8 0 6 12 7 3
% 11 6 0 9 10 4
% 1 12 9 0 3 5
% 5 7 10 3 0 6
% 2 3 4 5 6 0];
n=length(A);
k=1
www.eeworm.com/read/319701/13446274
m floyd.m
function [D,R]=floyd(A)
%用floyd算法实现求任意两点之间的最短路程。可以有负权
%参数D为连通图的权矩阵
% A=[0 2 8 1 inf inf inf inf
% 2 0 6 inf 1 inf inf inf
% 8 6 0 7 5 1 2 inf