New answers tagged

2 votes

How to use Callout in a directed graph with circular embedding?

...
kglr's user avatar
  • 377k
2 votes

How to use Callout in a directed graph with circular embedding?

...
halmir's user avatar
  • 14.6k
4 votes

How to use Callout in a directed graph with circular embedding?

1. Just use VertexLabels -> {v_ :> Placed[v /. vRule, "Circular"]} and a large value for ImageSize: ...
kglr's user avatar
  • 377k
6 votes
Accepted

How to use Callout in a directed graph with circular embedding?

First, two functions to be used as option settings for EdgeShapeFunction and VertexShapeFunction: ...
kglr's user avatar
  • 377k
4 votes

En route to Mobile (driving distances)

Using GeoGraphics ...
Bob Hanlon's user avatar
  • 149k
3 votes
Accepted

En route to Mobile (driving distances)

...
kglr's user avatar
  • 377k
3 votes

En route to Mobile (driving distances)

...
Syed's user avatar
  • 37.7k
3 votes
Accepted

How to map community structure with circular embedding and normalized edge weights?

Start from drawing graph based on community. Compute vertex coordinates: ccoord = CirclePoints[{1, 0}, 21][[Ordering[VertexIndex[g, Flatten[community]]]]]; ...
halmir's user avatar
  • 14.6k
3 votes

How to find a longest word path in dictionary?

I can't say that I know the combinatorics for this. Inspired by the thoughtful answer written by David G. Stork, here are some heuristic observations. Perhaps someone can write an authoritative answer ...
Syed's user avatar
  • 37.7k
6 votes
Accepted

Discrepancy between `IGEigenvectorCentrality` and `EigenvectorCentrality` in Mathematica

There is no discrepancy. Eigenvector centrality is an eigenvector, thus it is defined only up to a constant factor. ...
Szabolcs's user avatar
  • 232k
1 vote
Accepted

How can one convert between mtx format and graph format?

I assume we're working with adjacency matrices that you want to import or export in MTX format, and the goal is to create an adjacency matrix from a ...
creidhne's user avatar
  • 4,613
0 votes

NetGraph won't accept EmbeddingLayers of different n

Each element in a vector used in a neural network must be of the same type. In the NetGraph of your first example, your first EmbeddingLayer takes in input of type Restricted["Integer",2] (...
Dropped Bass's user avatar
6 votes
Accepted

Find a maximum $k$-colorable subgraph

Implementing David G. Stork's comment, this produces a graphic of all the maximal subgraphs that can be colored with $k$ colors. This is pretty rough and will probably get very slow for large vertex ...
ydd's user avatar
  • 2,634

Top 50 recent answers are included