Eunis 2002 Grafos 2001 New Technologies for Teaching and Learning António Roberto Ana Sofia Lino Escola Superior de Gestão de Santarém Portugal A Software.

Slides:



Advertisements
Similar presentations
Creating interactive User Feedback in DGS using the Scripting Interface of Cinderella Andreas Fest University of Education Schwäbisch Gmünd CADGME 2009.
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
Financial Data Calculator© Produced by: Mathematical Investment Decisions, Inc. 95 West Gate Drive – 2 nd Floor Cherry Hill, NJ Web site:
Automated creation of verification models for C-programs Yury Yusupov Saint-Petersburg State Polytechnic University The Second Spring Young Researchers.
Visual Studio Team System (VSTS). Richard Hundhausen Author of software development books Microsoft Regional Director Microsoft MVP (VSTS) MCT, MCSD,
Visio as a Business Process Analysis Tool Mark Nelson Senior Program Manager Microsoft Corporation.
CSC 2300 Data Structures & Algorithms April 17, 2007 Chapter 9. Graph Algorithms.
Insights and Answers for IT Professionals. 「 Microsoft ® Visio 2000 視覺化管理應用」 Developing Application Solutions using Visio 2000 Shawn Tng Regional Technical.
Chapter 7 Network Flow Models.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 15, Friday, October 3.
Network Flow Models Chapter 7.
Lecture 25 CSE 331 Nov 2, Adding teeth to group talk Form groups of size at most six (6) Pick a group leader I will ask group leader(s) to come.
Prepared by: Gerald R. Gray, Guiding Principle Consulting.
Open and save files directly from Word, Excel, and PowerPoint No more flash drives or sending yourself documents via Stop manually merging versions.
Instructor: Dr. Sahar Shabanah Fall Lectures ST, 9:30 pm-11:00 pm Text book: M. T. Goodrich and R. Tamassia, “Data Structures and Algorithms in.
What’s New in Visio 2007 Office Visio 2007 is easy to use and comes with diagram- specific shapes and tools that enable you to quickly create professional-looking.
Using Dijkstra’s Algorithm to Find a Shortest Path from a to z 1.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
Chapter 2 Graph Algorithms.
Chapter 11 An Introduction to Visual Basic 2008 Why Windows and Why Visual Basic How You Develop a Visual Basic Application The Different Versions of Visual.
Network Flow How to solve maximal flow and minimal cut problems.
SimArch: Work in Progress Multimedia Teaching Tool Faculty of Electronic Engineering University of Nis Serbia.
ENHANCED MONITORING TOOL PROJECT Project Presentation By: David Nasi & Amitay Svetlit Supervisor: Oved Itzhak Software Systems Lab Department of Electrical.
Session 9 Component and Deployment. OOAD with UML / Session 9 / 2 of 17 Review State Diagrams represent the software entities in terms of their states.
Mind Mapping: Illustrating personal connections Ms Mercado Harbor Heights M349.
Chapter 11 An Introduction to Visual Basic 2005 Why Windows and Why Visual Basic How You Develop a Visual Basic Application The Different Versions of Visual.
V Spanning Trees Spanning Trees v Minimum Spanning Trees Minimum Spanning Trees v Kruskal’s Algorithm v Example Example v Planar Graphs Planar Graphs v.
Microsoft® Office Visio® Professional 2007 for IT How to Use Visio for Project Management Presenter: Date: 1.
CS223 Advanced Data Structures and Algorithms 1 Review for Final Neil Tang 04/27/2010.
Some NP-complete Problems in Graph Theory Prof. Sin-Min Lee.
ADD-IN EXPRESS World-class Office extensions with little coding.
1 Towards a common statistical enterprise architecture Ongoing process reengineering at Statistics Sweden Service Oriented Architecture – SOA Sharing of.
Connect with life Vedant Kulshreshtha Technology Solutions Professional – SharePoint | Microsoft India
Programming Abstractions Cynthia Lee CS106X. Graphs Topics Graphs! 1.Basics  What are they? How do we represent them? 2.Theorems  What are some things.
NETWORK VISUALIZATION ABHISHEK KUMAR (2011CS50272)
Welcome to Visio Dan McAllister Just arriving? Sign-in near the door Grab a handout Just arriving? Sign-in near the door Grab a handout Finished for the.
Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation Author: Mark Minas Presenter: Song Gu.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Chapter 2- Visual Basic Schneider1 Chapter 2 Problem Solving.
Component and Deployment
Minimum Spanning Trees
Shortest Path from G to C Using Dijkstra’s Algorithm
Welcome to Visio Dan McAllister
Chapter 2- Visual Basic Schneider
Information Communication and Technology Services
COMP 6/4030 ALGORITHMS Prim’s Theorem 10/26/2000.
Chapter 12 Network Models 12-1
Graph Algorithm.
Social Media And Global Computing Introduction to Visual Studio
VISUAL BASIC – CHAPTER ONE NOTES An Introduction to Visual Basic
Minimum Spanning Trees
Visualizing Prim’s MST Algorithm Used to Trace the Algorithm in Class
Understanding the Visual IDE
Shortest-Paths Trees Kun-Mao Chao (趙坤茂)
Simple Graphs First we introduce some of the vocabulary: Node Vertex
Lecture 19-Problem Solving 4 Incremental Method
Chapter 2- Visual Basic Schneider
Analysis models and design models
Chapter 2- Visual Basic Schneider
Algorithms and data structures
Spanning Tree Algorithms
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
Purpose and Types of Desktop publishing software
Minimum spanning trees
Shortest Path Solutions
Prim’s algorithm for minimum spanning trees
Caveonix Solution Diagram Template
Presentation transcript:

Eunis 2002 Grafos 2001 New Technologies for Teaching and Learning António Roberto Ana Sofia Lino Escola Superior de Gestão de Santarém Portugal A Software Tool Graph’s Algorithms

Grafos 2001 A Software Tool for Teaching and Learning A Software Tool for Teaching and Learning Graph’s Algorithms Objectives Architecture Use Examples Conclusions Agenda

E B A C Graphical Input Problem’s Solution Algorithm’s Steps Objectives: D Grafos 2001 Graphical Output Extensible

Microsoft Visio gives the User Interface and the Drawing Capabilities Architecture Grafos 2001

Architecture Grafos 2001 Visio Customization with Grafo Template Grafo Shapes Stencil Master Shapes : Node Arc ResultsStep by Step Minimal Spanning Tree Shortest Path Maximum Flow Next Step Initial State

Architecture Grafos 2001 Visio Graphical User Interface Drawing Power

Architecture Grafos 2001 Visio Graphical User Interface Drawing Power What is missing ? Data Structure Algorithms ActiveX Dll Where do we put this logic ? Visio Add-In

Shape DeletedConnection DeletedText Changed Architecture Grafos 2001 Visio Add-In Internal Representation Shape Added Built-in Algorithms Event’s Handlers Connection Added Graph Editing Programming with Visio Objects

Architecture Grafos 2001 Visio Add-In Internal Representation Shortest Path Built-in Algorithms Event’s Handlers Results / Step by Step Output Programming with Visio Objects

Architecture Grafos 2001 Extensibility Built-in algorithms : Prim’s algorithm ( Minimal Spanning Tree ) Dijkstra’s algorithm ( Shortest Path ) Ford-Fulkerson ( Maximum Flow Problem ) Visio Add-In Internal Representation Built-in Algorithms Event’s Handlers How can we extend to other algorithms ? Grafos2001 Object Model Where do we write the new algorithms ? Automation Object Interface ActiveX Automation Server

Architecture Grafos 2001 Extensibility ActiveX Automation Server Visio Programming Environment Grafos2001 objects Programming with

Architecture Visio – Grafos2001 Synergy Grafos 2001 Internal Representation Built-in Algorithms Event’s Handlers Object’s Interface Event Visio Objects Grafos2001 Objects

Grafos 2001 Use Examples Built-in Algorithm : Shortest Path

Grafos 2001 Use Examples Extensibility Example Graph Coloring

Grafos 2001 Use Examples Extensibility Example Euler Theorem

Grafos 2001 Use Examples Extensibility Example Euler Circuit – Hierholzer’s Algorithm

Grafos 2001 Use Examples Extensibility Example Programming with Grafos2001’s Objects

Conclusions Grafos 2001 We think Grafos2001 can be used as a tool: We want to establish contact with other people interested. We haven’t feedback from portuguese universities contacted 2ª prize at Microsoft Portugal Software Contest ( Special/Universities ) Free download from that helps the teacher to prepare and expose the subject; that can be used to visualize the solutions and develop algorithms;

Conclusions Grafos 2001 Future work : add support to oriented graphs translate to English solve bugs detected expand Grafos2001 object model redesign the system