Reputation
5,806
Next privilege 10,000 Rep.
Access moderator tools
Badges
12 27
Newest
 Nice Answer
Impact
~50k people reached

Jan
30
revised How can I make this code to count Hamiltonian paths faster?
added 11 characters in body
Jan
30
answered How can I make this code to count Hamiltonian paths faster?
Jan
27
answered Printing graphics files on a 3D printer
Jan
27
revised Printing graphics files on a 3D printer
add computational-geometry tag
Jan
27
comment VertexLabels Options
Yes, you can. You can just map properties over you vertices. What do you have?
Jan
26
answered VertexLabels Options
Dec
11
revised RegionPlot of ImplicitRegion is incorrect
add computational-geometry tag
Dec
11
revised Why is DiscretizeGraphics missing points on my curve?
add computational-geometry tag
Dec
11
comment Graphing a pulsating sphere in a 3D vector field to illustrate divergence at point
@MichaelMcCain what you mean by rotate? Do you mean move ball with slider or rotate whole graph by mouse? it works fine on my Mathematica (10.3). And I don't see any rotation in the animation.
Dec
10
answered Graphing a pulsating sphere in a 3D vector field to illustrate divergence at point
Nov
16
comment How do I change one edge in a tree graph to a double arrow?
or SetProperty[{g, (11 -> 23)}, {EdgeStyle -> {Arrowheads[{-.05, .05}]}, PerformanceGoal -> "Quality"}]
Nov
16
comment Draw a de Bruijn graph with random vertex size
@R.M. did you change "Line" to (Line[#]&) ?
Nov
16
comment Draw a de Bruijn graph with random vertex size
for a perfect circle loop, set EdgeShapeFunction -> (Line[#] &)..
Oct
27
answered Spatial Display of “Union of Geodesics” in a Random Geometric Graph
Oct
18
awarded  Nice Answer
Oct
10
awarded  Nice Answer
Oct
7
comment Fast way to get edge-list of graph in terms of vertex indices (not vertex names)
@Szabolcs for 1, you could use WeightedAdjacencyMatrix: g = ExampleData[{"NetworkGraph", "CondensedMatterCollaborations2005"}]; {e, w} = UpperTriangularize[ WeightedAdjacencyMatrix[g]] /@ {"NonzeroPositions", "NonzeroValues"}; e is edge indices and w is weights matching with e.
Oct
2
comment Is there an easy way to set or retrieve a graph edge properties as a list, in a single go?
@Szabolcs no, it will be added to existing ones..
Oct
2
answered Is there an easy way to set or retrieve a graph edge properties as a list, in a single go?
Oct
1
comment How to use the “EdgeLayout” suboption of GraphLayout?
Yes, LCARemove take All and None. SplineWeight is not supported...