切换至中文 Over 1 million code package, 10 million code file free download
total: 23337
code resource search result

keyword: graph

  • [Java/JSP] jme.rar jME (jMonkey Engine) is a scenario-based map (scene graph), high-performance graphics API. jME design idea comes mainly from David Eberly wrote " 3D Game Engine Design" book. jME is a Java language using the graphics rendering engine.
    Category: Java Develop Upload User：hongtai Size：3943K
  • [Java/JSP] DijkstraAlgorithm_src.zip algorithm that finds the shortest path within a graph.
    Category: Algorithm Upload User：chengzeng Size：368K
  • [C/C++] cross-correlation.rar Use DSP5502 chip to realize cross-correlation algorithm, has been running tune-pass, you can use Graph inside the time/frequency by the effect.
    Category: DSP program Upload User：benlin99 Size：11K
  • [Visual C++ (VC++)] graph2d_demo.zip fantastic program to draw a dynamic graph
    Category: Windows Develop Upload User：aneey_liu Size：306K
  • [Visual C++ (VC++)] align_demo.zip best applction on graph
    Category: GUI Develop Upload User：pupu_8 Size：90K
  • [Matlab] GLTree220509.zip Builds a nearest neighbor graph in a very short time.In many cases is faster than ANN library.
    Category: Windows Develop Upload User：xfr818 Size：14K
  • [Visual C++ (VC++)] GRF_view.zip An utility to check .GRF-files, created by GraphEditor. Will show Direct Show filters used in the graph and check them for presents.
    Category: Multimedia Develop Upload User：hxwasher Size：43K
  • [Java/JSP] TwoPlotExample.rar a graph example in java with ptplot5.1p1 library
    Category: Java eBooks Upload User：lphhyp2008 Size：2K
  • [Matlab] mds.zip ... An MDS algorithm starts with a matrix of item–item similarities, then assigns a location to each item in N-dimensional space, where N is specified a priori. For sufficiently small N, the resulting locations may be displayed in a graph or 3D visualisation.
    Category: 3G develop Upload User：panrei Size：19K
  • [Visual C++ (VC++)] SpectralSurfaceReconstructionfromNoisyPointClouds. ... a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral graph partitioning to decide whether each tetrahedron is inside or outside the original object. The reconstructed surface triangulation ...
    Category: Development Research Upload User：sxypxh Size：7428K