You are not logged in. Please login at to post your questions!


How do I optimize my code?

I am trying to solve this problem :

I am using BFS to see if the graph is connected and then finding Eulerian path.

My code : (adjacency list) (adjacency matrix)

asked 30 Oct '15, 19:36

dragonemperor's gravatar image

accept rate: 10%

toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 30 Oct '15, 19:36

question was seen: 432 times

last updated: 30 Oct '15, 19:36