일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 | 31 |
- Recursion
- MDP
- Graph Neural Network
- 백준
- PathPlanning
- self driving car
- Motion Planning
- C
- 정적라이브러리
- 강화학습
- 선형대수
- path planning
- 소프티어
- GNN
- DynamicProgramming
- C++
- Dubins Path
- 동적라이브러리
- Hybrid A star
- GIT
- 수치최적화
- CPP
- CUDA
- OSQP
- Leetcode
- 공유라이브러리
- solver
- 경로생성
- Frenet Coordinate
- autonomous vehicle
- Today
- Total
목록전체 글 (127)
Swimmer
Solution - Use Bitwise operator class Solution { public: bool isPowerOfTwo(int n) { if (n < 0) { return false; } else { return n && !(n & n - 1); } } };
std::unordered_map This data structure is an associative container the contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constane-time complexity Internally, the elements are not osorte in any particular order, but organized into buckets. Properties Associative container Unique keys Reference : https://en.cppreference.com/w/cpp/container/unordered..
std::map Maps are associative containers that store elements formed by a combination of a key value and mapped value. The key values are generally used to sort and uniquely identify the elements The mapped values store the content associated to this key. The types of key and mapped value may differ. and both are grouped together by pair type typedef pair value_type; Internally, the elements in a..
Function Algorithm for finding the shortest paths between nodes in a graph It fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in a graph It uses a data structure for storing and querying partial solutions sorted by distance from the "source" node (Queue, prioirty - Queue in C++) Time Complexity prioirty queue - $$ \Theta ((\left| V \right| + \..