For programming questions about Microsoft's Distributed File System (DFS). (For questions about depth-first search, use the [depth-first-search] tag.)
Questions tagged [microsoft-distributed-file-system]
176 questions
0
votes
1 answer
Input/output error with fuse filesystem on linux?
I'm trying to mount my filesystem to a empty directory. The directory is /home/test. I have the following functions already written:
access
getattr
readdir
statfs
mkdir
rmdir
create
write
read
I use the command ./fusetest /home/test -d to mount my…

Erdong
- 1
- 1
- 1
0
votes
1 answer
Datanode keeps dying
I am running hadoop 0.20.2 (yes it's a legacy app).
I have a simple master-slave setup with 2 nodes.
I can start up the cluster fine with jps command on master:
4513 TaskTracker
4225 DataNode
4116 NameNode
4565 Jps
4329 SecondaryNameNode
4410…

C.A
- 620
- 1
- 11
- 23
0
votes
1 answer
Depth first search of an adjacency list java
I need some help with the DFS function below, while the algorithm for it is an iterative one, I can not figure out how to implement it in my code.
package graphexample;
import java.util.*;
class GraphExample {
class Edge {
int v, w;
public…

Sean
- 47
- 14
0
votes
1 answer
What's wrong with my dfs implementation?
I have implemented a dfs search for an 8 puzzle game but for some reason I can't manage to get it work as it should, my stack keeps adding and adding possible movements for my 8 puzzle game but it never decreases for an answer, I don't know if it is…

Cande
- 36
- 7
0
votes
1 answer
I have written DFS for graph using stack and adjecent lists, its not working like it should
typedef struct nodeTAG{
int data;
struct nodeTAG *next;
}nodeT;
typedef struct listTAG{
nodeT *front;
nodeT *end;
}listT;
void listinit (listT *plist)
{
plist -> front = NULL;
plist -> end = NULL;
}
int isempty (listT…

Maciek Nowacki
- 1
- 1
0
votes
0 answers
DFS Graph Search Java
I've been trying to implement a DFS search of a Graph as part of my project, but I've been having trouble with figuring exactly how the recursion is meant to work..., I think my code is correct, but the results show otherwise.
public void…

Nicholas Yong
- 24
- 2
0
votes
1 answer
Can we delete Pig Logs from hdfs dfs -ls /tmp/temp837895592 while Pig script is running?
It is taking up 600GB space on my cloud, and my code is still running. Wanted to know if this can be deleted.
0
votes
1 answer
find path between nodes in graph with DFS using stack
According to this image , I'm trying to write a program that finds all paths from vertex 1 to 7.
Exactly like this output.
I used DFS in my code using stack , but I received stack overflow error.
I want to have each of these outputs stored in list…

mnreat
- 11
- 2
0
votes
1 answer
Dfs using linked list in 2d matrix - C
I got for my school project a task that I dont know how to solve and I'm stuck. I have to run over this labyrinth:
#T###########
#.#...R.....#
#.###.#.###.#
#...Q.#...#.#
#.#####C###F#
#.A.........#
#B#####E#K#L#
…

Rastislav
- 11
- 1
0
votes
1 answer
Convert JSON to an unordered HTML list (DFS?)
I have a little problem with converting JSON to a list. I'm able to read all elements but currently it makes a bad list structurally.
Here is JSON:
{
name: 'test,
value: 'value',
nodes: [
{
name: 'next test',
value: 'next…

Marek Zygmunt
- 105
- 2
- 9
0
votes
3 answers
How to overcome this stack overflow issue when finding SCCs?
This is the code I wrote to find SCCs usigng Kosaraju's Two-Passed Algorithm. When I run the main method, I get a StackOverFlowError on SCC.revDFS. How can I avoid the stack overflow error when having a large amount of recursive calls?
import…

Vinson
- 1
0
votes
1 answer
How can I figure out if two nodes are connected in a graph with recursive depth first search in Java?
Note: the code below now reflects a working solution to the problem, I figured out the error.
I am trying to solve the simple problem of seeing if two nodes are connected. There are many solutions available that use a stack, and I can find much DFS…

Jason Blevins
- 125
- 1
- 6
0
votes
1 answer
Recursive for find shortest path using DFS in maze in java
`I got stack overflow error when using this code. i want it work if we already found the shortest path, then the recursive code will stop. the maze is contain character '#' and ' '. and if i found the shortest path, the path will mark with '.'…

Anne
- 11
- 1
- 3
0
votes
0 answers
Depth first Search graph from pandas frame?
I have a data frame as below which is df, the values between the index in columns and rows are weights.
A B B C
B 1 11 ... ..
C 11 2 .. ..
D 10 10
I use this code below for creating graph:
G =…

Windy764
- 77
- 7
0
votes
1 answer
Repeating 'False' outputs
I am trying to implement a dfs to find cycles in a string graph. For example the graph:
walkways_info = """\
U 3
0 1
1 2
2 0
"""
Would return True. I am currently having the issue that my if statement:
if current_vertex in visited or…

T. Kearsley
- 197
- 3
- 18