All Questions
10,901 questions
2
votes
1
answer
90
views
A simple method for compressing white space in text (Java)
Intro
Now I have that text space compressor. For example,
...
- 32k
-4
votes
1
answer
54
views
Object oriented programming deque implementation (after second thought)
The java.util.Deque implementation from Object oriented programming deque implementation that consists of three elements linked arrays, each array holding reference ...
user294788
2
votes
1
answer
102
views
ShannonFanoEncoder.java - computing prefix codes in Java
Intro
This time, I have implemented the Shannon-Fano coding.
Code
io.github.coderodde.compression.ShannonFanoEncoder.java
...
- 32k
-2
votes
0
answers
31
views
P3D + Processing - Java Support [closed]
Using P3D + Processing, to achieve random arrangement of boxes as attached below
00:31
https://vimeo.com/143076578?fl=pl&fe=vl
Colour/hatching not important, will be completed in post if requires ...
0
votes
0
answers
59
views
Jump point search in Java for faster pathfinding in grid mazes
(Refer to the entire repository in GitHub.)
How it looks like
Intro
This time, I present my take on Jump point search that I translated from Javascript (PathFinding.js/src/finders/JumpPointFinderBase....
- 32k
-2
votes
0
answers
67
views
Object oriented programming deque implementation [closed]
Implementation of java.util.Deque interface according to object oriented programming principles - abstraction, encapsulation, inheritance , polymorphism - suitable ...
user293682
4
votes
1
answer
87
views
Dijkstra's algorithm for non-uniform undirected hypergraphs: Take II - bidirectional Dijkstra's algorithm with excellent performance
Intro
(See the full repository here.)
A non-uniform undirected hypergraph is a generalization of an undirected graph. It is defined as \$H = (X, E)\$, where \$X\$ is the set of vertices and \$E \...
- 32k
4
votes
1
answer
177
views
API having flow - normal flow along with background poller(it also involves events which is not shown here)
We have an API in which we call external service with a tracking id.This first part of the API workflow makes an entry to the DB as SUBMITTED after the call to first external API say /E1 finishes and ...
- 277
-5
votes
0
answers
142
views
Deque implementation around strategy design pattern (second thought)
On a second thought, the Deque implementation around strategy design pattern changed with a new implementation of retainAll method according to the solution from ...
user293551
0
votes
0
answers
65
views
Computing loan cuts leading to a global zero equity in a financial graph (Java)
Intro
I won't specify the problem here, but instead, provide the link to the blog post discussing the problem and the full implementation.
Code
...
- 32k
4
votes
2
answers
135
views
Dijkstra's algorithm for non-uniform undirected hypergraphs
Intro
(Repo here.)
A non-uniform undirected hypergraph is a generalization of an undirected graph. It is defined as \$H = (X, E)\$, where \$X\$ is the set of vertices and \$E \subseteq \mathcal{P}(X)\$...
- 32k
-4
votes
1
answer
105
views
Deque implementation around strategy design pattern
Implementation of java.util.Deque interface based on string of POJOs, that is plain old java object, encapsulating a field for holding reference to each object ...
user293515
5
votes
2
answers
414
views
Ordinary insertion sort vs. straight insertion sort in Java (benchmark)
Intro
So this time I wanted to find out which of the two insertion sort flavours are faster:
Code
io.github.coderodde.util.StraightInsertionSort.java:
...
- 32k
0
votes
0
answers
57
views
Computing \$k\$ most reliable paths in undirected probabilistic graphs in Java
Intro
(See MostProbablePath.java.)
This time, I elaborate on Computing most probable (reliable) path in a probabilistic graph (take II): instead of computing the most reliable path I now return \$k\$ ...
- 32k
4
votes
1
answer
284
views
Computing most probable (reliable) path in a probabilistic graph (take II)
Intro
A probabilistic graph \$G = (V, E)\$ is an undirected graph with weight function \$w \colon E \rightarrow [0, 1]\$. In the most reliable path problem we -- given two terminal nodes \$s \in V\$ ...
- 32k