Skip to main content

Home/ Mac Attack/ Group items tagged algorithm

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
Benjamin Bandt-Horn

Model-driven engineering - Wikipedia, the free encyclopedia - 0 views

en.wikipedia.org/...Model-driven_engineering

Software Engineering design pattern

shared by Benjamin Bandt-Horn on 12 Jan 14 - Cached
  • Model-driven engineering (MDE) is a software development methodology which focuses on creating and exploiting domain models (that is, abstract representations of the knowledge and activities that govern a particular application domain), rather than on the computing (or algorithmic) concepts.
  • Benjamin Bandt-Horn on 12 Jan 14
     
    Model-driven engineering (MDE) is a software development methodology which focuses on creating and exploiting domain models (that is, abstract representations of the knowledge and activities that govern a particular application domain), rather than on the computing (or algorithmic) concepts.
Benjamin Bandt-Horn

gameobjects - Algorithms for games and realtime applications - Google Project Hosting - 0 views

code.google.com/gameobjects

python game library

shared by Benjamin Bandt-Horn on 14 Jan 14 - No Cached
  • Benjamin Bandt-Horn on 14 Jan 14
     
    Game Objects is a collection of 2D and 3D maths classes, and algorithms for helping in the creation of games with Python. Suitable for PyGame, but independent of it.
Benjamin Bandt-Horn

Binary Search Tree library in Python | Laurent Luce's Blog - 0 views

www.laurentluce.com/...-search-tree-library-in-python

binary tree python

shared by Benjamin Bandt-Horn on 27 Dec 13 - No Cached
  • This article is about a Python library I created to manage binary search trees. I will go over the following: Node class Insert method Lookup method Delete method Print method Comparing 2 trees Generator returning the tree elements one by one
  • https://laurentluce@github.com/laurentluce/python-algorithms.git
  • binary search tree
  • ...5 more annotations...
  • Delete method
  • There are 3 possibilities to handle: 1- The node to remove has no child. 2- The node to remove has 1 child. 3- The node to remove has 2 children.
  • look for its successor by going right then left until we reach a leaf
  • if node is None:
  • ‘A’ < ‘B’ is True in Python.
  • Benjamin Bandt-Horn on 27 Dec 13
     
    This article is about a Python library I created to manage binary search trees. I will go over the following: Node class Insert method Lookup method Delete method Print method Comparing 2 trees Generator returning the tree elements one by one
1 - 4 of 4
Showing 20▼ items per page