Skip to content
This repository has been archived by the owner on Oct 8, 2021. It is now read-only.

Commit

Permalink
Merge pull request #5 from sbromberger/hotfix
Browse files Browse the repository at this point in the history
Lint fixes
  • Loading branch information
sbromberger committed Feb 10, 2015
2 parents 3568195 + b27abce commit 47e0d2d
Show file tree
Hide file tree
Showing 3 changed files with 5 additions and 5 deletions.
2 changes: 1 addition & 1 deletion src/dijkstra.jl
Original file line number Diff line number Diff line change
Expand Up @@ -198,7 +198,7 @@ function dijkstra_shortest_paths(
sources::AbstractVector{Int};
visitor::AbstractDijkstraVisitor=TrivialDijkstraVisitor())
state::DijkstraStates = create_dijkstra_states(graph)
dijkstra_shortest_paths!(graph, sources, visitor, state)
dijkstra_shortest_paths!(graph, edge_dists, sources, visitor, state)
end

function dijkstra_shortest_paths(
Expand Down
6 changes: 3 additions & 3 deletions src/persistence.jl
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@ function readgraph(fn::AbstractString)
f = GZip.open(fn,"r") # will work even if uncompressed
line = chomp(readline(f))
nstr, dirundir = split (line,r"\s*,\s*")
n = int(nstr)
n = parseint(nstr)
if dirundir == "u"
directed = false
end
Expand All @@ -25,8 +25,8 @@ function readgraph(fn::AbstractString)
while !eof(f)
line = chomp(readline(f))
src_s, dst_s = split(line,r"\s*,\s*")
src = int(src_s)
dst = int(dst_s)
src = parseint(src_s)
dst = parseint(dst_s)
add_edge!(g, src, dst)
end
return g
Expand Down
2 changes: 1 addition & 1 deletion src/smallgraphs.jl
Original file line number Diff line number Diff line change
Expand Up @@ -38,7 +38,7 @@
# > (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# > OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

function CompleteGraph(n::Integer; is_directed=true)
function CompleteGraph(n::Integer)
g = Graph(n)
for i = 1:n, j=1:n
if i < j
Expand Down

0 comments on commit 47e0d2d

Please sign in to comment.