Questions tagged [edges]

Edges represent the logical connection between two regions in an entity. In the case of graphs, edges refer to the logical connection between two vertices, or nodes. Use this tag whenever you have a question about working with or traversing edges in a graph or a graph-based database. See also [edge-list].

582 questions
-1
votes
1 answer

Directed igraph over a point

Got a question for you about the package igraph. When the igraph is directed, is it possible to give an input like from A to C over B? A directed edge from A to C over B? Like a train from Spain(A) to Russia(C). The Train drives through…
meilirog
  • 15
  • 1
  • 4
-1
votes
1 answer

Darken Layer Outline in photoshop

How can I darken my layer edges in photoshop? As you can see in image below the layer edge is in a color like light pink or purple. how can I make the edges black? Click for Image
Dcember
  • 9
  • 2
-1
votes
1 answer

copying edges with adjacent vertices and their properties using BOOST

I'm trying to copy an edge from a graph and add it to another (with all his vertices and properties), I make something like: if (!dataG.empty()) { auto const& gr = dataG.front(); // firslt graph in G_list auto ep =…
-1
votes
1 answer

How to flip the edge of two connected triangles?

let's say I have two triangles with one shared edge. How can I flip the triangle order so that the two single points make up the new common edge? Thanks
-2
votes
1 answer

How to draw circle after contour detection has been performed

I am working on the project where i first need to detect the object and make outline that covers whole object it can be seen on 1st image. It was successfuly done by the contour Detection. The next thing which i want to to do is to make a circle…
-2
votes
1 answer

How do I connect Counterparty B to C and vice versa without changing the arragement

How do I connect counterparty B to D and vice versa without changing the arrangement setup. Here are the codes digraph graphname { A [label="Counterparty A" color=Blue, fontcolor=Red, fontsize=24, shape=box] // node T B…
user460329
  • 21
  • 3
-2
votes
1 answer

How to import an adjacency array from a file in .txt format with edge notation (v, w)?

How to import an adjacency array from a file in .txt format with edge notation (v, w) in RStudio? The contents of the .txt file are as follows: 5vertices,não dirigido 0,1 1,2 1,3 2,3 3,4 4,0 Reinforcement that this is the notation of vertices in the…
Tiago
  • 11
  • 1
-2
votes
1 answer

How to convert List of Edges to Adjacency Matrix in C++ with the number of edges connected to a vertex instead of ones?

I am struggling to convert a list of Edges to Adjacency Matrix in a certain required way. Problem: The Adjacency matrix should have number of edges connected to a vertex, so it should not have only 1s where two vertexes are connected. For better…
Kallo
  • 17
  • 1
  • 5
-3
votes
1 answer

Remove blank spaces from scanned photos

I am browsing for days now to find a solution to this problem. No existing solution has worked yet. Here is my problem : I scan photos, on which there are some blank spaces (that can be anywhere (top, right, left, bottom)). I would like to adjust…
secavfr
  • 628
  • 1
  • 9
  • 24
-3
votes
1 answer

Finding all edge types in a graph. Tree, Forward, Backward or Cross edges

I spent several hours looking for a pseudocode that would compute the edge types in a graph. I couldn't find a complete version so I wrote a new one. I will share it as a reply to this post, so others can reach it if needed.
fenadoruk
  • 133
  • 1
  • 5
1 2 3
38
39