OldGraphs.jl
OldGraphs.jl copied to clipboard
JuliaAttic
Working with graphs in Julia
I have a directed graph that I want to traverse from a given vertex. If I use `VertexListVisitor` I can get the list of vertices. What I want is the...
``` julia using Graphs g = adjlist(Int) add_vertex!(g, 1) add_vertex!(g, 3) add_edge!(g, 3, 1) ``` This code throws the following error: ``` ~/tmp $ julia hello.jl ERROR: BoundsError() in add_edge!...
Using Julia 0.3 (1 day old), I got the following message when runing `plot(g)`: ``` WARNING: writesto(cmd,args...) is deprecated, use open(cmd,"w",args...) instead. ERROR: could not spawn `neato -Tx11`: no such...
I have no prior experience in graphs, and don't know how to use this library to create a graph from scratch, get info from that graph and use some functions...
In most methods, the graph is listed last, but in others it is listed first. There are probably good reasons for each particular case, but I've ordered the parameters incorrectly...
In a lot of algorithms, we have to use vertex or edge as indices to retrieve corresponding attributes such as colors and weights. In my original design, this is through...
Currently, a-star search is the only algorithm using any vertex properties (for the distance heuristic), so the a-star code was changed. The a-star code used the vertex type to index...
If `e in edges(g) == true`, shouldn't it follow that `revedge(e) in edges(g) == true` for undirected graphs?
Currently, `traverse_graph` declares the vertex colormap parameter as defaulting to `zeros(Int, num_vertices(graph))` and the edge colormap defaulting to `zeros(Int, num_edges(graph))`. There is no easy way to check the requirement that...
@pozorvlak Here is the failed attempt at testing `remove_edge!`. Even though testing works here, it still does not work locally.