networks: route traffic from the wlan0 interface through the Wireguard wg0 interface

I built a Wireguard client on my Raspberry Pi based on this tutorial:

My interfaces are:

eth0  ( <-> router ( <-> internet

wg0   (

wlan0 ( dnsmasq + hostapd) <-> mobile clients connected (192.168.254.x/24)

The way i have it /etc/wireguard/wg0.conf

using AllowedIPs = makes all my traffic go through Wireguard wg0 Interface

using AllowedIPs = I have to sudo ip addr flush dev wlan0 before it brings wg0 and I can't access the internet directly using eth0 Interface.

How to fix my routes?

How to use my shared host directory with aws route 53 subdomain?

I have my web application hosted by a shared hosting provider (A2hosting). I need to link my web files on my shared hosting server to a subdomain on AWS Route 53. Can anyone advise me on this?

Windows: How do I create and route a fake audio output to a real one?

I have a program that claims the default audio device in exclusive mode. This cannot be changed and it doesn't seem to make any sound if you don't want it in sound settings.

So I figured the only way to fix this would be to give it a fake audio output to claim, which routes to my headphones' audio output device, so I can hear other things while using the program. it's possible?

Networks: Why do I sometimes get a trace route that performs four internal LAN hops before reaching the WAN? And this is a problem that I should solve?

Why could I get 10 … and 192.168 .. internal IPs every time I perform a concert?

If I do a concert I will get something like:

  1    20 ms    10 ms    11 ms
  2    11 ms    11 ms    10 ms
  3     9 ms     9 ms    18 ms
  4    10 ms    11 ms    10 ms
  5     *        *        *     Request timed out.
  6    21 ms    23 ms    22 ms []
  7    22 ms    22 ms    21 ms
  8    23 ms    26 ms    22 ms
  9    22 ms    21 ms    22 ms
 10    20 ms    21 ms    19 ms []


  1     2 ms     1 ms     1 ms
  2    11 ms    10 ms    10 ms
  3     9 ms     9 ms    22 ms
  4    10 ms    14 ms    12 ms
  5     *        *        *     Request timed out.
  6    22 ms    31 ms    26 ms
  7    25 ms    29 ms    26 ms
  8    25 ms    25 ms    24 ms []

The first concert is rare. Most of the time goes first instead of an address 10 … * first.

Is it possible that my ISP is creating a double NAT? If so, is there any workaround other than using a VPN?

algorithms: optimal route of TSP with branching and binding

enter the image description here

I just wanted a little clarification on the image above. I understand the general idea of ​​building a tree in DFS order and stopping once you find a larger number than before. For example, when the value of the path becomes $ 14 $ or $ inf $ the algorithm stops because there was already a value path $ 11 $. But, I'm pretty confused about where these numbers come from (the lower cost limits). For example, the path from the vertex $ A $ to the vertex $ B $ has length $ 1 $, but in the tree, the path from $ A $ to $ B $ has a lower limit of $ 10 $.

Therefore, I would greatly appreciate if someone could tell me where the numbers in the branch and limit search tree come from.

Charts: Why do we do a topological ranking to find the shortest or longest route in weighted DAG?

I was wondering why we have to do the topological type before performing edge relaxation.

Wouldn't it be better if we do it?
if the starting vertex is "s"

while(the queue is not empty)
 for every adjacent vertex v of u
   if( dist(v) > dist(u) + weight(u,v) )
       dist(v) = dist(u) + weight(u,v)
       add v to the queue

I had intentionally left the array visit ()

javascript – Find the best route and price in an array

Hello, how to tell the customer which route and ticket price are most important.
For example: how to know which destination is more affordable in or In the following program I can only see the most affordable value:

var myRoutes = (
{ "": 1, "Price": 10, "Sigla": '' },
{ "grarulhos.santacatarina": 2, "Price": 18, "Sigla": 'grarulhos.santacatarina' },
{ "": 3, "Price": 56, "Sigla": '' },
{ "": 4, "Price": 75, "Sigla": '' },
{ "minasgerais.santacatarina": 5, "Price": 20, "Sigla": 'minasgerais.santacatarina' },
{ "saopaulo.santacatarina": 6, "Price": 5, "Sigla": 'saopaulo.santacatarina' }  

function findBy(arr, key, compRoutes) {
    return arr.reduce(function(prev, curr, index, arr) {
    return, prev(key), curr(key)) ? prev : curr;

function minComp(prev, curr) {
    return prev < curr;

console.log('Sigla: ' + findBy(myRoutes, 'Price', minComp).Sigla + ' / Valor: ' + findBy(myRoutes, 
'Price', minComp).Price);

php – router system like laravel, how to manage route creation and router controller?

I'm trying to create a URL router system, for educational purposes, that has a similar usage to that of Laravel, but I'm curious about how I can register routes like laravel does (with individual calls to static methods), here it is my "conceptual" Code I made using a TDD approach:

        $Route = new Route;
        ->setCallback(function () {
            return 'get user';

        $Route2 = new Route;

        $Router = new Router;
        // if the route is matched this methods are called
        // $Router->handleMiddlewares();
        // $Router->handleCallback();

1: is there a better approach on how to encapsulate route object creation in a simple / shorter way?
In Laravel we can trace routes like this:

Route::get($uri, $callback);
Route::post($uri, $callback);
Route::put($uri, $callback)->name('foo');

2 – should the router class be responsible for filtering routes (regular expression rules, etc.), handling callbacks and middlewares?

algorithms: can anyone help me in this Dp problem to find minimal movements in route search?

Thanks for contributing with a response to Computer Science Stack Exchange!

  • Please make sure answer the question. Please provide details and share your research!

But avoid

  • Ask for help, clarification or respond to other answers.
  • Make statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

For more information, check out our tips on how to write great answers.

graphics: find the longest route by number of edges, excluding cycles

I need to analyze a directed graph, but I don't know the name of the algorithm I would need to use. The graph has many cycles.

My desired behavior is: given a graphical source and a graphical sink, find the longest path by number of edges, excluding cycles.

By graphic font, I mean a vertex with one or more edges to other vertices and no incoming edges, and the opposite to sink. If there is better terminology let me know about it.

By excluding cycles, this could involve not traversing an edge of the previously traversed process.

Do you recognize this algorithm and could you tell me the name please?

Thanks in advance