This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cassert> | |
#include <cstdio> | |
#include <fstream> | |
#include <iostream> | |
#include <memory> | |
#include <stdexcept> | |
// helper class for runtime polymorphism demo below | |
struct B | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
SHELL = /bin/sh | |
OOQP=../../.. | |
OOQPINCLUDEDIR=$(OOQP)/include | |
OOQPLIBDIR=$(OOQP)/lib | |
CXX = c++ | |
CXXFLAGS =-O |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// A C++ Program to implement A* Search Algorithm | |
#include<bits/stdc++.h> | |
using namespace std; | |
#define ROW 9 | |
#define COL 10 | |
// Creating a shortcut for int, int pair type | |
typedef pair<int, int> Pair; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
A* grid planning | |
author: Atsushi Sakai(@Atsushi_twi) | |
Nikos Kanargias ([email protected]) | |
See Wikipedia article (https://en.wikipedia.org/wiki/A*_search_algorithm) | |
""" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include "stdafx.h" | |
#include "Astar.h" | |
int map[101][101] = | |
{ | |
{0,0,0,1,0,1,0,0,0}, | |
{0,0,0,1,0,1,0,0,0}, | |
{0,0,0,0,0,1,0,0,0}, | |
{0,0,0,1,0,1,0,1,0}, | |
{0,0,0,1,0,1,0,1,0}, | |
{0,0,0,1,0,0,0,1,0}, |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import sys | |
import time | |
import numpy as np | |
from matplotlib.patches import Rectangle | |
import point | |
import random_map |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// C / C++ program for Dijkstra's shortest path algorithm for adjacency | |
// list representation of graph | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <limits.h> | |
// A structure to represent a node in adjacency list | |
struct AdjListNode | |
{ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Program to print BFS traversal from a given | |
// source vertex. BFS(int s) traverses vertices | |
// reachable from s. | |
#include<iostream> | |
#include <list> | |
using namespace std; | |
// This class represents a directed graph using | |
// adjacency list representation |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> | |
int main(){ | |
const int c = 0; | |
int* p = (int*)&c; | |
printf("Begin...\n"); | |
*p = 5; | |
printf("c = %d\n",c); | |
printf("End...\n"); |
NewerOlder