Go To English Version 超过100万源码资源,1000万源码文件免费下载
  • Graphy Computes graph identities in strongly regular graphs. Undergraduate research project at CMU. GPL3 This is a graph identity generation program created as part of an undergraduate research project at CMU. ...
  • mt-plugin-messaging ... Please see for all of the above. ## LICENSE ## This program is distributed under the terms of the GNU General Public License, version 2 ...
  • lcsh-subset ... code.google.com/p/hive-mrc/), which can load SKOS RDF. This command line program uses the OpenSearch API at id.loc.gov to do a query, page through the results, build up a graph of the SKOS concepts, and output the graph as RDF/XML. For ...
  • wurzel ... scales at which the measure is calculated. Have a look at `main.py` for that purpose. - root tree extraction: The `grid` program is configurable using command line parameters. Try running `grid --help` to find out more, e.g. Allowed options: ...
  • GraphingEnglish ... on words and a very very simple text-based graph. (Unfortunately, the graph is based on the full count of ... but it's good enough.) Part 2: How Your Program Should Be Run -------------------------------------- Step 1: Configure StarCluster If running ...
  • tdl ... = { u_texture: new tdl.textures.loadTexture(someImage), } var model = new tdl.models.Model(program, arrays, textures); // At Draw time var sharedUniforms = { u_projectionMatrix: projectionMatrix, }; var ...
  • DVL ... that data, not control flow is the most important aspect of a program focused on data visualization. DVL is built on top of [D3 ... `c`. This is important for DVL to calculate the dependency graph and ensure that it is acyclic. Modifying a variable without ...
  • maid ... and contributors. Thank you! See [AUTHORS][] and the [contributors graph][] for more info. [authors]: https://github.com/benjaminoakes/ ... ')) end ``` ## Warranty THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT ...
  • 99problems ... (alternative solution) Write a predicate that splits a graph into its connected components. P89 (**) Bipartite graphs Write a ... your computer do the work! Just write a little program ;-). The puzzle goes like this: Essentially, each row ...
  • PL0-Language-Tools ... see a abstract syntax tree of your program, use the pl0_graphviz.py command: ./pl0_graphviz.py < examples/fibonacci.pl1 A sample graph is included in the `examples` directory. For more advanced usage, including documentation ...