Extra standard Libraries used:
Available Code Snippets Downloaded :
Simple and flexible data structure for easy handling,
expansion and manipulation for input points.
Can hold any number of connections and nodes within a
Output the final circuit in a different window with
Drew Connections keeping the color coding in
Arranged those points on the final graph.
Found the remaining points in the circuit.
Laid out the chain as the skeleton of the output.
Found the Longest Chain in the input Circuit.
Took the input on the OpenGL base.
Finding the longest chain in a set of N points with no
limitations on the connections should take
This means the steps for a 50 point limit circuit is
Electrica doesn’t calculate the longest chain after the
input is complete, in fact, it intelligently and intuitively
keeps storing the parameters for longest chain as the
user interacts and enters the nodes and makes
Electrica does it in 3 steps!!
To avoid overlapping, we use counters in the Y-
direction which completes the circuit with all
OpenGL does not directly support text output, so we
had to include the built In libraries of bitmap fonts and
modify them to serve our purpose of node labeling.
• Maximum nodes is limited ( Can be increased as per
requirement by the developer)
• Number of build chains is limited ( The algorithm for
‘n’ number of chains has been developed as well.
Recursion would be used and the program can be
modified. Time needed..)
•DrawConnections() is not at its best potential due to
limitations in time, but better algorithms have been
devised and are ready to be implemented for a more
This project is presently an infant to the world of
graphs and OpenGL..
It can be taken forward to build applications that
would find use in multiple areas..
IV. PLATFORM INDEPENDENCE (Runs on LINUX OS)
V. RANGE OF APPLICATION
Based on file formats and data structures
Remember “Mesh charting &
Easy import and manipulation of heavy meshes on humble
R G B
“GPS Devices..” ?
Use of our algorithms to find suitable(longest, shortest) paths in a
“Labyrinth routing..” ?
Solving of various mazes using the incorporated algorithms.
Interest in solving Graph based
Optimization of graph analyzing
algorithms is at a nascent stage ,
Very co$tly similar softwares..
NI MultiSim : ~ $3,000
NI LabView : ~ $3,500
Encounter with complex jumbled
circuits gave a kick..
Prices as on www.ni.com(21/03/08)