12
votes
Accepted
4
votes
Accepted
How to see if two graphs are the same (including node names)?
The IGSameGraphQ function from the IGraph/M package will do this check. Vertex names are required to match, but edge/vertex ordering doesn't. Edge tags, if ...
- 233k
4
votes
Accepted
How can one calculate the co-normal (disjunctive/or) product of two graphs in Wolfram Language?
As noted in this Community post, the conormal/disjunctive product can be implemented like so for unweighted graphs:
...
3
votes
Accepted
How can I determine the cycle lengths in a directed graph?
a = {{0, 1, 0, 0}, {0, 0, 1, 0}, {1, 0, 0, 1}, {1, 0, 0, 0}};
g = AdjacencyGraph[a];
Length /@ FindCycle[g, Infinity, All]
{3, 4}
- 14.8k
3
votes
3
votes
Creating hexagonal grid (hexagonal grid graph)
Looks like there's an undocumented function GraphComputation`HexagonalGridGraph. I don't know what version it first appeared, but I see it in V13.3:
...
- 35.5k
2
votes
Accepted
How to simulate a directed acyclic graph?
An idea in order to generalize the steps 3 and 4, considering the definition of the weighted graph given by edges and weights:
...
- 1,691
Only top scored, non community-wiki answers of a minimum length are eligible