Questions tagged as 'grafo'

0
answers

Memory garbage when pointing a pointer

In an attempt to implement an adjacent array graph, I created the createVertice function in which a new "array" would be created and the contents of the graph would be copied to it, adding the new positions. However, when calling this function a...
asked by 24.08.2018 / 20:44
1
answer

Kruskal's Algorithm sorted with selection sort

I am trying to compare two variables of a struct type, however it is returning error. struct aresta{ int v1; int v2; int peso; }; ... aresta peso[62816]; aresta aux; int i, j=0; for(i=0; i<(tamanhoVetor - 1); i++){ int...
asked by 11.06.2018 / 09:45
0
answers

C - Stack Smashing Detected - How to correctly initialize a graph by adjacency list and insert edges?

I am getting sporadically and without making any changes to the code or entry, an error called Stack Smashing Detected. The only thing I'm doing is initializing a graph and inserting an edge in that, follow the code below: typedef int TipoPeso...
asked by 08.05.2018 / 18:30
0
answers

Display of graphs in c ++

Does anyone know of any library that manages graphs in c ++? or do you have any idea how I can develop this?     
asked by 20.04.2018 / 22:11
1
answer

How to use the Cycle Check Algorithm in Graphs?

Hello, I would like to know how to use the Cycle Check Algorithm in Graphs to find a cyclic condition, if you can put me the algorithm usage in this Graph below:     
asked by 09.08.2017 / 16:03
1
answer

Create Graphs with TSimpleGraph

I need to create graphs in the interface of my program, the only solution I found was TSimpleGraph . I tried to run the program that comes in the ZIP file, however it gives an error that the component TSimpleGraph is missing. I alread...
asked by 21.06.2017 / 15:03
0
answers

Flow at minimum cost

How do I find the minimum cost flow in a digraph whose arcs have a lower and upper bound for the flow and cost per unit of flow? Note: Do not use linear programming. Initially there is no viable flow. Only the offer of the vendor vertex is kn...
asked by 12.02.2016 / 22:43
1
answer

Circular Oriented Graphs with Mongodb

Does anyone know if it is possible to create circular oriented graphs with Mongodb or need a specific graph-oriented database such as neo4j. Node A (The alloy with B) Node B (B alloys with C) Node C (C binds to A) A-> -B-> -C-> -A (c...
asked by 17.11.2015 / 17:08
1
answer

Framework in C # that implements Graph Theory

Does anyone know of any framework in C # that implements Graph Theory?     
asked by 24.06.2015 / 18:16
1
answer

Do deep search using a stack

I'm trying to do an in-depth search using a stack, but it's giving an error in if and I do not know why. package Grafos; import java.io.*; import java.util.*; public class Grafo { LinkedList<Integer> Arestas []; int n;...
asked by 31.08.2018 / 19:46