Questions tagged [graph]
A graph is an abstract representation of objects (vertices) connected by links (edges). For questions about plotting data graphically, use the [data-visualization] tag instead.
714 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
3
votes
3
answers
83
views
PathFinding.java: Beam search in Java
Intro
I am currently working on this project (PathFinding.java). This time, I need to get the following class reviewed:
Code
...
1
vote
0
answers
59
views
Fixed BIDDFS (bidirectional iterative deepening depth first search) in Java
Intro
I have this GitHub repository for doing pathfinding in directed unweighted graphs. This post is about BIDDFS proposed by Richard Korf in his paper.
Code
...
1
vote
0
answers
28
views
Use Mathemaitca to calculate Treewidth
The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition.
I wrote Mathemaitca code to calculate Treewidth
based on the Python ...
1
vote
0
answers
30
views
LibID: a Java library containing some iterative deepening algorithms for pathfinding on directed unweighted graphs
Intro
I have this GitHub repository containing some iterative deepening pathfinding algorithms.
Code
...
6
votes
2
answers
111
views
Slack User Interaction Graph – Collaboration Topology
I’ve written a small Python module to generate mock Slack workspace data, build a user–user interaction graph, and surface complementary collaborators based on skill sets.
The key features are:
Data ...
5
votes
1
answer
57
views
Generate Javascript call graph in Graphviz DOT language
I use the following code to create a call graph from javascript file(s). I generate the output in Graphviz DOT language in order to create visualizations of that graph using the Graphviz command line.
...
5
votes
1
answer
340
views
Iterative DFS with Optimized Space Complexity
Background
I can't seem to find an existing answer solving this doubt of mine.
In academic books, it seems that DFS is usually presented in both recursive and iterative forms.
The implementations ...
1
vote
1
answer
60
views
How to count disconnected components in grid efficiently, if we can move left, right, down and top from any cell
I solved this problem: A. Ice Skating, Codeforces
My approach was to create grid from given snow drifts coordinates, then convert this grid into graph and then count how many disconnected components ...
-1
votes
1
answer
65
views
Graph Neural Network (GNN) (2) [duplicate]
This is an implementation of a graph neural network.
Edges are represented by an egde-list.
...
1
vote
1
answer
145
views
Graph Neural Network (GNN) (1)
The given datasets are graph data structure that represents social interactions.
The nodes will be represented as People{node_id, edge, gender, occupation} and the ...
8
votes
2
answers
2k
views
Bug Byte puzzle from Jane Street
This is a puzzle from Jane Street.
Given this graph:
Fill in the edge weights in the graph with the numbers 1 through 24, using each number exactly once. Labeled nodes provide some additional ...
2
votes
1
answer
81
views
Clique Connect: minimum spanning tree
Problem Statement
You are given a weighted undirected graph G with N vertices, numbered 1 to N. Initially, G has no edges.
You will perform M operations to add edges to G. The i-th operation (1≤i≤M) ...
5
votes
3
answers
337
views
Find highest number of swaps within a set of possible duty swaps with networkx and PuLP
With huge help from Stack Overflow, I have created code which takes possible swap matches with given weights as an input and outputs a set of matches which gives the highest weight with the highest ...
5
votes
1
answer
127
views
Optimising Graphed Rewards
Relates to this and this.
Simply put; I want to be able to distribute a total reward among network, where the distribution diminishes according to the depth of the network but the total sum of ...
2
votes
1
answer
268
views
Graphs for distributing rewards
I want to be able to distribute a total reward among referral network, where the distribution diminishes according to the depth of the network but the total sum of distributed rewards equals the ...